A bee colony optimization algorithm to job shop scheduling

被引:119
作者
Chong, Chin Soon [1 ]
Low, Malcolm Yoke Hean [4 ]
Sivakumar, Appa Iyer [2 ]
Gay, Kbeng Leng [3 ]
机构
[1] Singapore Inst Mfg Technol, 71 Nanyang Dr, Singapore 638075, Singapore
[2] Nanyang Technol Univ, Sch Mech & Prod Engn, Singapore 639798, Singapore
[3] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore 639798, Singapore
[4] Nanyang Technol Univ, Sch Comp Engn, Singapore 639798, Singapore
来源
PROCEEDINGS OF THE 2006 WINTER SIMULATION CONFERENCE, VOLS 1-5 | 2006年
关键词
D O I
10.1109/WSC.2006.322980
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In the face of globalization and rapidly shrinking product life cycle, manufacturing companies are trying different means to improve productivity through management of machine utilization and product cycle-time. Job shop scheduling is an important task for manufacturing industry in terms of improving machine utilization and reducing cycle-time. However, job shop scheduling is inherently a NP-hard problem with no easy solution. This paper describes a novel approach that uses the honey bees foraging model to solve the job shop scheduling problem. Experimental results comparing the proposed honey bee colony approach with existing approaches such as ant colony and tabu search will be presented.
引用
收藏
页码:1954 / +
页数:3
相关论文
共 25 条
[1]  
ABBAS HA, 2001, IN WORKSH ART LIF
[2]   THE SHIFTING BOTTLENECK PROCEDURE FOR JOB SHOP SCHEDULING [J].
ADAMS, J ;
BALAS, E ;
ZAWACK, D .
MANAGEMENT SCIENCE, 1988, 34 (03) :391-401
[3]  
Applegate D., 1991, ORSA Journal on Computing, V3, P149, DOI 10.1287/ijoc.3.2.149
[4]   Guided local search with shifting bottleneck for job shop scheduling [J].
Balas, E ;
Vazacopoulos, A .
MANAGEMENT SCIENCE, 1998, 44 (02) :262-275
[5]   The job shop scheduling problem: Conventional and new solution techniques [J].
Blazewicz, J ;
Domschke, W ;
Pesch, E .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 93 (01) :1-33
[6]  
Blum C., 2004, Journal of Mathematical Modelling and Algorithms, V3, P285, DOI DOI 10.1023/B:JMMA.0000038614.39977.6F
[7]   A BRANCH-AND-BOUND ALGORITHM FOR THE JOB-SHOP SCHEDULING PROBLEM [J].
BRUCKER, P ;
JURISCH, B ;
SIEVERS, B .
DISCRETE APPLIED MATHEMATICS, 1994, 49 (1-3) :107-127
[8]  
BUFFA ES, 1968, OPERATIONS MANAGEMEN, P454
[9]  
Chong CS, 2005, PROCEEDINGS OF THE 2005 WINTER SIMULATION CONFERENCE, VOLS 1-4, P2194
[10]   Ant system: Optimization by a colony of cooperating agents [J].
Dorigo, M ;
Maniezzo, V ;
Colorni, A .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 1996, 26 (01) :29-41