Authors: You-lian Zheng, Yuan-xiang Li, De-ming Lei
Addresses: State Key Laboratory of Software Engineering, Wuhan University, Wuhan 430072, China; Faculty of Mathematics and Computer Science, Hubei University, Wuhan 430062, China. ' State Key Laboratory of Software Engineering, Wuhan University, Wuhan 430072, China. ' School of Automation, Wuhan University of Technology, Wuhan 430070, China
Abstract: In this paper, fuzzy job shop scheduling problems are considered and an efficient swarm-based neighbourhood search (SNS) is proposed, in which an ordered operation-based representation and the decoding procedure are given. It is proved that most of possible actual completion times lie in the cut of fuzzy completion time for each job. In SNS, adaptive swap operation and binary tournament selection are applied to update swarm. SNS is compared with some methods from literature and computational results demonstrate that SNS has promising advantage on fuzzy scheduling.
Keywords: fuzzy scheduling; job shop scheduling; swarm-based neighbourhood search; SNS; ordered operation list; adaptive swap operation; binary tournament selection; fuzzy numbers; fuzzy logic.
International Journal of Innovative Computing and Applications, 2011 Vol.3 No.3, pp.144 - 151
Available online: 15 Aug 2011Full-text access for editors Access for subscribers Purchase this article Comment on this article