Comparing Schedule Generation Schemes in Memetic Algorithms for the Job Shop Scheduling Problem with Sequence Dependent Setup Times

The Job Shop Scheduling Problem with Sequence Dependent Setup Times (SDJSS) is an extension of the Job Shop Scheduling Problem (JSS) that has interested to researchers during the last years. In this paper we confront the SDJSS problem by means of a memetic algorithm. We study two schedule generation schemas that are extensions of the well known G&T algorithm for the JSS. We report results from an experimental study showing that the proposed approaches produce similar results and that both of them are more efficient than other genetic algorithm proposed in the literature.

[1]  María R. Sierra,et al.  New Codification Schemas for Scheduling with Genetic Algorithms , 2005, IWINAC.

[2]  Pierre Lopez,et al.  Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational Analysis , 2005, Ann. Oper. Res..

[3]  Alberto Gómez,et al.  A knowledge-based evolutionary strategy for scheduling problems with bottlenecks , 2003, Eur. J. Oper. Res..

[4]  G. Thompson,et al.  Algorithms for Solving Production-Scheduling Problems , 1960 .

[5]  Mauro Dell'Amico,et al.  Applying tabu search to the job-shop scheduling problem , 1993, Ann. Oper. Res..

[6]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[7]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[8]  J. Wesley Barnes,et al.  Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches , 2005, Eur. J. Oper. Res..

[9]  Hong Zhou,et al.  Using Genetic Algorithms and Heuristics for Job Shop Scheduling with Sequence-Dependent Setup Times , 2001, Ann. Oper. Res..

[10]  P. Brucker,et al.  A branch & bound method for the general-shop problem with sequence dependent setup-times , 1996 .

[11]  Peter Brucker,et al.  A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..

[12]  J. Carlier,et al.  Adjustment of heads and tails for the job-shop problem , 1994 .

[13]  Reha Uzsoy,et al.  Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times , 1993, Oper. Res. Lett..

[14]  C. Bierwirth.  A generalized permutation approach to job shop scheduling with genetic algorithms , 1995 .

[15]  Dirk C. Mattfeld,et al.  Evolutionary Search and the Job Shop - Investigations on Genetic Algorithms for Production Scheduling , 1996, Production and Logistics.

[16]  Camino R. Vela,et al.  Genetic Algorithms Hybridized with Greedy Algorithms and Local Search over the Spaces of Active and Semi-active Schedules , 2005, CAEPIA.

[17]  Éric D. Taillard,et al.  Parallel Taboo Search Techniques for the Job Shop Scheduling Problem , 1994, INFORMS J. Comput..