Generalized Cyclic Open Shop Scheduling and a Hybrid Algorithm

Document Type: Research Paper

Authors

Industrial Engineering Department, Sharif University of Technology, Tehran, Iran

Abstract

In this paper, we first introduce a generalized version of open shop scheduling (OSS), called generalized cyclic open shop scheduling (GCOSS) and then develop a hybrid method of metaheuristic to solve this problem. Open shop scheduling is concerned with processing n jobs on m machines, where each job has exactly m operations and operation i of each job has to be processed on machine i . However, in our proposed model of GCOSS, processing each operation needs more than one machine (or other resources) simultaneously. Furthermore, the schedule is repeated more than once. It is known that OSS is NP-hard. Therefore, for obtaining a good solution for GCOSS, which is obviously NP-hard, a hybrid algorithm is also developed. This method is constructed by hybridizing ant colony optimization (ACO), beam search and linear programming (LP). To verify the accuracy of the method, we also compare the results of this algorithm with the optimal solution for some special problems.

Keywords

Main Subjects


[1] Blum C. (2005), Beam-ACO-Hybridizing ant colony optimization with beam search: an application to
open shop scheduling; Computers and Operations Research 32; 1565-1591.
[2] Deuber W., Zhu X. (1997), Circular Coloring of Weighted Graphs; Journal of Graph Theory 23; 365-
376.

[3] Dorigo M., Stutzle T. (2004), Ant colony optimization; Boston, MA: MIT Press.
[4] Garey M.R., Johnson D.S. (1979), Computers and intractability; A guide to the theory of NPCompleteness,
Freeman, San Francisco.
[5] Kubale M., Nadolski A. (2005), Chromatic scheduling in a cyclic open shop; European Journal of
Operation Research; 164(99); 585-591.
[6] Liaw C.F. (2003), An efficient tabu search approach for the two-machine preemptive open shop
scheduling; computers & Operations Research 30, 2081-2095.
[7] Ow P.S., Morton T.E. (1988), Filtered beam search in scheduling; International Journal of Production
Research 26; 297-307.
[8] Stutzle T, Hoos H.H. (2000), MAX-MIN ant system; Future Generation Computer Systems 16(8);
889-914.
[9] Zhu X. (1992), Star-chromatic numbers and products of graphs; Journal of Graph Theory 16; 557-
569.