Cultural algorithms, an alternative heuristic to solve the job shop scheduling problem

In this work, an approach for solving the job shop scheduling problem using a cultural algorithm is proposed. Cultural algorithms are evolutionary computation methods that extract domain knowledge during the evolutionary process. Additional to this extracted knowledge, the proposed approach also uses domain knowledge given a priori (based on specific domain knowledge available for the job shop scheduling problem). The proposed approach is compared with respect to a Greedy Randomized Adaptive Search Procedure (GRASP), a Parallel GRASP, a Genetic Algorithm, a Hybrid Genetic Algorithm, and a deterministic method called shifting bottleneck. The cultural algorithm proposed in this article is able to produce competitive results with respect to the two approaches previously indicated at a significantly lower computational cost than at least one of them and without using any sort of parallel processing.

[1]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

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

[3]  O. Catoni Solving Scheduling Problems by Simulated Annealing , 1998 .

[4]  Marco Dorigo,et al.  Ant system for Job-shop Scheduling , 1994 .

[5]  Franz Rothlauf,et al.  Representations for genetic and evolutionary algorithms , 2002, Studies in Fuzziness and Soft Computing.

[6]  J. Barnes,et al.  Solving the job shop scheduling problem with tabu search , 1995 .

[7]  Zbigniew Michalewicz,et al.  A Survey of Constraint Handling Techniques in Evolutionary Computation Methods , 1995 .

[8]  S. Binato,et al.  A Grasp for Job Shop Scheduling , 2002 .

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

[10]  Robert G. Reynolds,et al.  CAEP: An Evolution-Based Tool for Real-Valued Function Optimization Using Cultural Algorithms , 1998, Int. J. Artif. Intell. Tools.

[11]  Simon Ronald,et al.  Robust Encodings in Genetic Algorithms , 1997 .

[12]  Albert Jones,et al.  Survey of Job Shop Scheduling Techniques , 1999 .

[13]  David B. Fogel,et al.  Evolutionary Computation: Towards a New Philosophy of Machine Intelligence , 1995 .

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

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

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

[17]  Mauricio G. C. Resende,et al.  A hybrid genetic algorithm for the job shop scheduling problem , 2005, Eur. J. Oper. Res..

[18]  Zbigniew Michalewicz,et al.  Evolutionary Algorithms for Constrained Parameter Optimization Problems , 1996, Evolutionary Computation.

[19]  Carlos A. Coello Coello,et al.  THEORETICAL AND NUMERICAL CONSTRAINT-HANDLING TECHNIQUES USED WITH EVOLUTIONARY ALGORITHMS: A SURVEY OF THE STATE OF THE ART , 2002 .

[20]  Yasuhiro Tsujimura,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies , 1999 .

[21]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

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

[23]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[24]  Tom Michael Mitchell Version spaces: an approach to concept learning. , 1979 .

[25]  Tapan P. Bagchi,et al.  Multiobjective Scheduling by Genetic Algorithms , 1999 .

[26]  Lawrence J. Fogel,et al.  Intelligence Through Simulated Evolution: Forty Years of Evolutionary Programming , 1999 .

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

[28]  Miao Li,et al.  Study of population diversity of multiobjective evolutionary algorithm based on immune and entropy principles , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

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

[30]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[31]  Robert G. Reynolds,et al.  Cultural algorithms: theory and applications , 1999 .

[32]  Marcel Bergerman,et al.  Cultural algorithms: concepts and experiments , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[33]  Carlos A. Coello Coello,et al.  Adding Knowledge And Efficient Data Structures To Evolutionary Programming: A Cultural Algorithm For Constrained Optimization , 2002, GECCO.

[34]  R. Reynolds,et al.  Using knowledge-based evolutionary computation to solve nonlinear constraint optimization problems: a cultural algorithm approach , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

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

[36]  Renata M. Aiex,et al.  Parallel GRASP with path-relinking for job shop scheduling , 2003, Parallel Comput..

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

[38]  Peter Ross,et al.  Producing robust schedules via an artificial immune system , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[39]  Edward G. Coffman,et al.  Computer and job-shop scheduling theory , 1976 .

[40]  Peter Ross,et al.  The evolution and analysis of potential antibody library for use in job-shop scheduling , 1999 .