An Efficient Method for the Open-Shop Scheduling Problem Using Simulated Annealing

This paper presents a simulated annealing algorithm in order to solve the nonpreemptive open-shop scheduling problem with the objective of minimizing the makespan. The method is based on a simulated annealing algorithm that efficiently explores the solution space. The method was implemented and tested on various benchmark problems in the literature. Experimental results show that the algorithm performs well on the benchmarks. The algorithm was able to find an optimum solution in many cases.

[1]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[2]  Peter Ross,et al.  A Promising Hybrid GA/Heuristic Approach for Open-Shop Scheduling Problems , 1994, ECAI.

[3]  Anurag Agarwal,et al.  Non‐greedy heuristics and augmented neural networks for the open‐shop scheduling problem , 2005 .

[4]  Christian Prins,et al.  Competitive genetic algorithms for the open-shop scheduling problem , 2000, Math. Methods Oper. Res..

[5]  Teofilo F. Gonzalez,et al.  Open Shop Scheduling to Minimize Finish Time , 1976, JACM.

[6]  Christian Blum,et al.  Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling , 2005, Comput. Oper. Res..

[7]  Christian Prins,et al.  Classical and new heuristics for the open-shop problem: A computational evaluation , 1998, Eur. J. Oper. Res..

[8]  T. Yamada,et al.  Job shop scheduling , 1997 .

[9]  Ching-Fang Liaw,et al.  An iterative improvement approach for the nonpreemptive open shop scheduling problem , 1998, Eur. J. Oper. Res..

[10]  Eugene L. Lawler,et al.  Chapter 9 Sequencing and scheduling: Algorithms and complexity , 1993, Logistics of Production and Inventory.

[11]  Peter Ross,et al.  A Promising Genetic Algorithm Approach to Job-Shop SchedulingRe-Schedulingand Open-Shop Scheduling Problems , 1993, ICGA.

[12]  Ching-Fang Liaw,et al.  A hybrid genetic algorithm for the open shop scheduling problem , 2000, Eur. J. Oper. Res..

[13]  Ching-Fang Liaw,et al.  A tabu search algorithm for the open shop scheduling problem , 1999, Comput. Oper. Res..

[14]  Sami Khuri,et al.  Genetic Algorithms for Solving Open Shop Scheduling Problems , 1999, EPIA.

[15]  Ching-Fang Liaw,et al.  Applying simulated annealing to the open shop scheduling problem , 1999 .

[16]  Lawrence Davis,et al.  Job Shop Scheduling with Genetic Algorithms , 1985, ICGA.