DocumentCode
1808587
Title
A Bee Colony Optimization Algorithm to Job Shop Scheduling
Author
Chong, Chin Soon ; Low, Malcolm Yoke Hean ; Sivakumar, Appa Iyer ; Gay, Kheng Leng
Author_Institution
Singapore Inst. of Manuf. Technol., Nanyang
fYear
2006
fDate
3-6 Dec. 2006
Firstpage
1954
Lastpage
1961
Abstract
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 are presented
Keywords
computational complexity; job shop scheduling; optimisation; product life cycle management; NP-hard problem; ant colony; bee colony optimization algorithm; honey bees foraging model; job shop scheduling; machine utilization management; product cycle-time management; product life cycle; tabu search; Computer aided manufacturing; Costs; Evolutionary computation; Globalization; Job shop scheduling; Optimized production technology; Resource management; Scheduling algorithm; Throughput; Web server;
fLanguage
English
Publisher
ieee
Conference_Titel
Simulation Conference, 2006. WSC 06. Proceedings of the Winter
Conference_Location
Monterey, CA
Print_ISBN
1-4244-0500-9
Electronic_ISBN
1-4244-0501-7
Type
conf
DOI
10.1109/WSC.2006.322980
Filename
4117838
Link To Document