Finding multiple solutions in job shop scheduling by niching genetic algorithms

The interest in multimodal optimization methods is increasing in the last years. The objective is to find multiple solutions that allow the expert to choose the solution that better adapts to the actual conditions. Niching methods extend genetic algorithms to domains that require the identification of multiple solutions. There are different niching genetic algorithms: sharing, clearing, crowding and sequential, etc. The aim of this study is to study the applicability and the behavior of several niching genetic algorithms in solving job shop scheduling problems, by establishing a criterion in the use of different methods according to the needs of the expert. We will experiment with different instances of this problem, analyzing the behavior of the algorithms from the efficacy and diversity points of view.

[1]  Graham McMahon,et al.  On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness , 1975, Oper. Res..

[2]  Ling Wang,et al.  An effective hybrid optimization strategy for job-shop scheduling problems , 2001, Comput. Oper. Res..

[3]  Samir W. Mahfoud.  Crowding and Preselection Revisited , 1992, PPSN.

[4]  Ralf Bruns,et al.  Direct Chromosome Representation and Advanced Genetic Operators for Production Scheduling , 1993, ICGA.

[5]  Thomas Stützle,et al.  Local search algorithms for combinatorial problems - analysis, improvements, and new applications , 1999, DISKI.

[6]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[7]  David E. Goldberg,et al.  Genetic Algorithms with Sharing for Multimodalfunction Optimization , 1987, ICGA.

[8]  Harold H. Greenberg,et al.  A Branch-Bound Solution to the General Scheduling Problem , 1968, Oper. Res..

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

[10]  S. S. Panwalkar,et al.  A Survey of Scheduling Rules , 1977, Oper. Res..

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

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

[13]  V. Rao Vemuri,et al.  Multiniche Crowding in Genetic Algorithms and Its Application to the Assembly of DNA Restriction-Fragments , 1994, Evolutionary Computation.

[14]  Jeffrey R. Barker,et al.  Scheduling the General Job-Shop , 1985 .

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

[16]  Alain Pétrowski,et al.  A clearing procedure as a niching method for genetic algorithms , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[17]  G. Rand.  Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

[18]  Bruno Sareni,et al.  Fitness sharing and niching methods revisited , 1998, IEEE Trans. Evol. Comput..

[19]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[20]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[21]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[22]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[23]  Isao Ono,et al.  An Efficient Genetic Algorithm for Job Shop Scheduling Problems , 1995, International Conference on Genetic Algorithms.

[24]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[25]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[26]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[27]  Takeshi Yamada,et al.  A Genetic Algorithm Applicable to Large-Scale Job-Shop Problems , 1992, PPSN.

[28]  Ralph R. Martin,et al.  A Sequential Niche Technique for Multimodal Function Optimization , 1993, Evolutionary Computation.

[29]  Egon Balas,et al.  Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm , 1969, Oper. Res..

[30]  Georges R. Harik,et al.  Finding Multimodal Solutions Using Restricted Tournament Selection , 1995, ICGA.

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

[32]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[33]  D. Atkin.  OR scheduling algorithms. , 2000, Anesthesiology.

[34]  Shengxiang Yang,et al.  Constraint satisfaction adaptive neural network and heuristics combined approaches for generalized job-shop scheduling , 2000, IEEE Trans. Neural Networks Learn. Syst..

[35]  Takeshi Yamada,et al.  Conventional Genetic Algorithm for Job Shop Problems , 1991, ICGA.