论文信息 - An evolutionary approach to the job-shop scheduling problem

An evolutionary approach to the job-shop scheduling problem

This paper focuses on the heuristic hybridization and the genetic search as a methodology to develop a computationally efficient heuristic for the job-shop scheduling problem (JSP). In order to adapt the JSP to a genetic algorithm (GA), the ASGPL (Active-Schedule Generation with a Priority-List) algorithm with a hopping scheme was proposed, and using a GA, an iterative schedule improvement procedure called EVIS (Evolutionary Intracell Scheduler) was designed. The genetic search in EVIS was parallelized with a model of subpopulations and migration. Without implementing any problem-tailored heuristic for the job-shop scheduling problem, EVIS was able to find optimal solutions to a number of different problem instances in reasonable computation time.<<ETX>>

C. S. George Lee | C. S. Lee | Gyoung H. Kim | Gyoung-Hahn Kim

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

[2] David E. Goldberg,et al. Alleles, loci and the traveling salesman problem , 1985 .

[3] G. Syswerda,et al. Schedule Optimization Using Genetic Algorithms , 1991 .

[4] D. J. Smith,et al. A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.

[5] Said Ashour. A DECOMPOSITION APPROACH FOR THE MACHINE SCHEDULING PROBLEM , 1967 .

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

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

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

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

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

[11] Lawrence Davis,et al. Applying Adaptive Algorithms to Epistatic Domains , 1985, IJCAI.

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

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

[14] Reiko Tanese,et al. Distributed Genetic Algorithms , 1989, ICGA.

[15] Lawrence Davis,et al. Adapting Operator Probabilities in Genetic Algorithms , 1989, ICGA.