SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM

In this article, a hybrid metaheuristic method for solving the open shop scheduling problem (OSSP) is proposed. The optimization criterion is the minimization of makespan and the solution method consists of four components: a randomized initial population generation, a heuristic solution included in the initial population acquired by a Nawaz-Enscore-Ham (NEH)-based heuristic for the flow shop scheduling problem, and two interconnected metaheuristic algorithms: a variable neighborhood search and a genetic algorithm. To our knowledge, this is the first hybrid application of genetic algorithm (GA) and variable neighborhood search (VNS) for the open shop scheduling problem. Computational experiments on benchmark data sets demonstrate that the proposed hybrid metaheuristic reaches a high quality solution in short computational times. Moreover, 12 new hard, large-scale open shop benchmark instances are proposed that simulate realistic industrial cases.

[1]  FEDERICO DELLA CROCE,et al.  A genetic algorithm for the job shop problem , 1995, Comput. Oper. Res..

[2]  Christelle Guéret,et al.  A new lower bound for the open‐shop problem , 1999, Ann. Oper. Res..

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

[4]  Peter Brucker,et al.  A Branch & Bound Algorithm for the Open-shop Problem , 1997, Discret. Appl. Math..

[5]  Mutsunori Banbara,et al.  Compiling finite linear CSP into SAT , 2006, Constraints.

[6]  Mehmet Fatih Tasgetiren,et al.  A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem , 2007, Eur. J. Oper. Res..

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

[8]  Christos D. Tarantilis,et al.  Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm , 2009, Comput. Oper. Res..

[9]  Frank Werner,et al.  Constructive heuristic algorithms for the open shop problem , 1993, Computing.

[10]  Krzysztof Fleszar,et al.  An effective heuristic for the CLSP with set-up times , 2003, J. Oper. Res. Soc..

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

[12]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[13]  Hideo Tanaka,et al.  Genetic algorithms for flowshop scheduling problems , 1996 .

[14]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

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

[16]  Jan Karel Lenstra,et al.  A Computational Study of Local Search Algorithms for Job Shop Scheduling , 1994, INFORMS J. Comput..

[17]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[18]  I. Adiri,et al.  Open‐shop scheduling problems with dominated machines , 1989 .

[19]  Michel Gendreau,et al.  A guide to vehicle routing heuristics , 2002, J. Oper. Res. Soc..

[20]  Krzysztof Fleszar,et al.  Solving the resource-constrained project scheduling problem by a variable neighbourhood search , 2004, Eur. J. Oper. Res..

[21]  Mitsuo Gen,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation , 1996 .

[22]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[23]  D. Y. Sha,et al.  A new particle swarm optimization for the open shop scheduling problem , 2008, Comput. Oper. Res..

[24]  Marc Gravel,et al.  Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems , 2005, J. Oper. Res. Soc..

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

[26]  V. S. Tanaev,et al.  Scheduling Theory: Multi-Stage Systems , 1994 .

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

[28]  C. D. Tarantilis,et al.  A list-based threshold accepting method for job shop scheduling problems , 2002 .

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

[30]  Massimo Paolucci,et al.  Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach , 2007, Comput. Oper. Res..

[31]  John M. Wilson,et al.  A genetic algorithm for flow shop scheduling problems , 2004, J. Oper. Res. Soc..