Scheduling in a sequence dependent setup environment with genetic search

Abstract Work on scheduling in the presence of squence dependent setup times has generally focused on minimizing the total setup time (or cost) or minimizing the makespan of a set of jobs. We explore the problem of sequencing to minimize the total tardiness of a set of jobs in a single-stage process where setup times are sequence dependent. In particular, we examine the efficacy of using genetic search to develop near optimal schedules in this environment.

[1]  Ergin Uskup,et al.  A Branch-and-Bound Algorithm for Two-Stage Production-Sequencing Problems , 1975, Oper. Res..

[2]  J. William Gavett,et al.  Three Heuristic Rules for Sequencing Jobs to a Single Production Facility , 1965 .

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

[4]  Hamilton Emmons,et al.  Scheduling Production on One Machine with Changeover Costs , 1977 .

[5]  John J. Grefenstette,et al.  Genetic Algorithms for the Traveling Salesman Problem , 1985, ICGA.

[6]  Maurice Queyranne,et al.  The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling , 1978, Oper. Res..

[7]  Sushil K. Gupta.  n jobs and m machines job-shop problems with sequence-dependent set-up times , 1982 .

[8]  B. J. Lageweg,et al.  Minimizing Total Costs in One-Machine Scheduling , 1975, Oper. Res..

[9]  A. G. Lockett,et al.  Technical Note - A Scheduling Problem Involving Sequence Dependent Changeover Times , 1972, Oper. Res..

[10]  S. S. Panwalkar,et al.  Sequencing Research and the Industrial Scheduling Problem , 1973 .

[11]  Salah E. Elmaghraby,et al.  Symposium on the Theory of Scheduling and Its Applications , 1973 .

[12]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[13]  Augustine O. Esogbue,et al.  Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach , 1974 .

[14]  J. Wesley Barnes,et al.  Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs , 1981, Oper. Res..

[15]  William P. Darrow,et al.  The two-machine sequence dependent flowshop scheduling problem , 1986 .

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

[17]  Richard C. Wilson,et al.  Sequence dependent set-up times and job sequencing , 1977 .

[18]  Sam Kwong,et al.  Genetic algorithms and their applications , 1996, IEEE Signal Process. Mag..

[19]  C. A. Komar,et al.  The Effectiveness of Three Heuristic Rules for Job Sequencing in a Single Production Facility , 1973 .

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

[21]  Joseph Y.-T. Leung,et al.  Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..

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

[23]  Soumen Ghosh,et al.  A MILP model for the n-job, M-stage flowshop with sequence dependent set-up times , 1986 .

[24]  T. Prabhakar.  A Production Scheduling Problem with Sequencing Considerations , 1974 .

[25]  Kenneth Alan De Jong,et al.  An analysis of the behavior of a class of genetic adaptive systems. , 1975 .

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

[27]  Harvey J. Greenberg,et al.  New approaches for heuristic search: A bilateral linkage with artificial intelligence , 1989 .

[28]  C. R. Glassey,et al.  Minimum Change-Over Scheduling of Several Products on One Machine , 1968, Oper. Res..

[29]  George L. Nemhauser,et al.  The Traveling Salesman Problem: A Survey , 1968, Oper. Res..