Ant colony optimization for the single machine early or tardy problem with distinct ready times

被引：0

作者：

Song, Yang ^{[1
]}

Zhang, Zhihai ^{[1
]}

Zheng, Li ^{[1
]}

机构：

[1] Department of Industrial Engineering, Tsinghua University, Beijing 100084, China

来源：

Qinghua Daxue Xuebao/Journal of Tsinghua University | 2005年 / 45卷 / 11期

关键词：

Algorithms; -; Applications; Bionics; Optimization; Testing;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Single machine scheduling problems with distinct ready times and due dates are usually solved using heuristic algorithms. An ant colony optimization (ACO) algorithm was used to minimize the total weighted early and tardy penalties and to analyze the applicability of bionic algorithms. The adjacent pairwise interchange (API) method was used for a local search to improve the solution quality with idle times optimally inserted into each solution. The results of 90 tests made using the ACO algorithm compare well with results of the Branch and Bound method and the Tabu search method.

引用

页码：1577 / 1580

共 50 条

[1] THE SINGLE-MACHINE EARLY TARDY PROBLEM
OW, PS
MORTON, TE
MANAGEMENT SCIENCE, 1989, 35 (02) : 177 - 191
[2] An Improved Ant Colony Algorithm for a Single-machine Scheduling Problem with Setup Times
YE Qiang LIU Xinbao LIU Lin YANG Shanglin School of ManagementHefei University of TechnologyHefei China
武汉理工大学学报, 2006, (S3) : 956 - 961
[3] An improved ant colony algorithm for a single-machine scheduling problem with setup times
Ye Qiang
Liu Xinbao
Liu Lin
Yang Shanglin
1ST INTERNATIONAL SYMPOSIUM ON DIGITAL MANUFACTURE, VOLS 1-3, 2006, : 956 - 961
[4] Ant colony optimization for single machine total weighted earliness/tardiness problem
Song, Y
Zhang, ZH
Zheng, L
PROCEEDINGS OF THE 11TH INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS 1 AND 2: INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT IN THE GLOBAL ECONOMY, 2005, : 301 - 305
[5] Ant colony optimization for the single machine total earliness tardiness scheduling problem
M'Hallah, Rym
Alhajraf, Ali
NEW FRONTIERS IN APPLIED ARTIFICIAL INTELLIGENCE, 2008, 5027 : 397 - 407
[6] The single-machine absolute-deviation early-tardy problem with random completion times
AlTurki, UM
Mittenthal, J
Raghavachari, M
NAVAL RESEARCH LOGISTICS, 1996, 43 (04) : 573 - 587
[7] Simulated annealing algorithm for solving the single machine early/tardy problem
Lyu, J
Gunasekaran, A
Ding, JH
INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 1996, 27 (07) : 605 - 610
[8] Heuristics for the single machine scheduling problem with early and quadratic tardy penalties
Valente, Jorge M. S.
EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING, 2007, 1 (04) : 431 - 448
[9] A genetic algorithm for solving the single machine earliness/tardiness problem with distinct due dates and ready times
Tsai, Tung-I
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2007, 31 (9-10): : 994 - 1000
[10] A genetic algorithm for solving the single machine earliness/tardiness problem with distinct due dates and ready times
Tung-I Tsai
The International Journal of Advanced Manufacturing Technology, 2007, 31 : 994 - 1000

← 1 2 3 4 5 →