A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation

Abstract Job-shop scheduling problem (abbreviated to JSP) is one of the well-known hardest combinatorial optimization problems. During the last three decades, the problem has captured the interest of a significant number of researchers and a lot of literature has been published, but no efficient solution algorithm has been found yet for solving it to optimality in polynomial time. This has led to recent interest in using genetic algorithms (GAs) to address it. The purpose of this paper and its companion (Part II: Hybrid Genetic Search Strategies) is to give a tutorial survey of recent works on solving classical JSP using genetic algorithms. In Part I, we devote our attention to the representation schemes proposed for JSP. In Part II, we will discuss various hybrid approaches of genetic algorithms and conventional heuristics. The research works on GA/JSP provide very rich experiences for the constrained combinatorial optimization problems. All of the techniques developed for JSP may be useful for other scheduling problems in modern flexible manufacturing systems and other combinatorial optimization problems.

[1]  Yoshikazu Nishikawa,et al.  A Parallel Genetic Algorithm based on a Neighborhood Model and Its Application to Jobshop Scheduling , 1993, PPSN.

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

[3]  Varghese S. Jacob,et al.  A genetics-based hybrid scheduler for generating static schedules in flexible manufacturing contexts , 1993, IEEE Trans. Syst. Man Cybern..

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

[5]  R. Storer,et al.  New search spaces for sequencing problems with application to job shop scheduling , 1992 .

[6]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

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

[8]  R. Haupt,et al.  A survey of priority rule-based scheduling , 1989 .

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

[10]  Mitsuo Gen,et al.  A survey of penalty techniques in genetic algorithms , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[11]  Mitsuo Gen,et al.  Genetic algorithms and engineering design , 1997 .

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

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

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

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

[16]  Erwin Pesch,et al.  Evolution based learning in a job shop scheduling environment , 1995, Comput. Oper. Res..

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

[18]  Emanuel Falkenauer,et al.  A genetic algorithm for job shop , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

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

[20]  D. E. Goldberg,et al.  Genetic Algorithms in Search, Optimization & Machine Learning , 1989 .

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

[22]  Jacek Blazewicz,et al.  Scheduling in Computer and Manufacturing Systems , 1990 .

[23]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

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

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

[26]  Alice E. Smith,et al.  Genetic Optimization Using A Penalty Function , 1993, ICGA.

[27]  Lawrence Davis,et al.  Using a genetic algorithm to optimize problems with feasibility constraints , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[28]  Thomas E. Morton,et al.  Heuristic scheduling systems : with applications to production systems and project management , 1993 .

[29]  Keith E. Mathias,et al.  In Parallel Problem Solving from Nature-PPSN III , 1994 .

[30]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

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

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

[33]  Kazuhiko Kawamura,et al.  Exploring Problem-Specific Recombination Operators for Job Shop Scheduling , 1991, ICGA.

[34]  Don T. Phillips,et al.  A state-of-the-art survey of dispatching rules for manufacturing job shop operations , 1982 .

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

[36]  Jan Paredis,et al.  Exploiting Constraints as Background Knowledge for Genetic Algorithms: A Case-Study for Scheduling , 1992, PPSN.

[37]  A. Kan.  Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .

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

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