An adaptable problem-space-based search method for flexible flow line scheduling

Problem-space-based neighborhoods have been recently suggested in the literature for the approximate solution of scheduling problems. This paper explores how effectively these neighborhoods can be adapted to different regular measures of performance in the context of flexible flow line scheduling. Specifically, makespan and mean tardiness are used in the experiments. Near-optimal solutions and significant improvements in the performance of single-pass heuristics are found when searching these spaces with simple local search techniques for industrial and randomly generated problems.

[1]  Robert J. Wittrock,et al.  An Adaptable Scheduling Algorithm for Flexible Flow Lines , 1988, Oper. Res..

[2]  Jeffrey D. Ullman,et al.  NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..

[3]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[4]  J. Hunsucker,et al.  BRANCH AND BOUND ALGORITHM FOR THE FLOW SHOP WITH MULTIPLE PROCESSORS , 1991 .

[5]  R. J. Paul.  A Production Scheduling Problem in the Glass-Container Industry , 1979, Oper. Res..

[6]  Chelliah Sriskandarajah,et al.  Scheduling algorithms for flexible flowshops: Worst and average case performance , 1988 .

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

[8]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[9]  Chandrasekharan Rajendran,et al.  Scheduling in n-job, m-stage flowshop with parallel processors to minimize makespan , 1992 .

[10]  V. Jorge Leon,et al.  Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling , 1995 .

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

[12]  Robert J. Wittrock,et al.  Scheduling Algorithms for Flexible Flow Lines , 1985, IBM J. Res. Dev..

[13]  Stefan Voß,et al.  The Two — Stage Hybrid — Flowshop Scheduling Problem with Sequence — Dependent Setup Times , 1993 .

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

[15]  Robert J. T. Morris,et al.  Heuristic methods for flexible flow line scheduling , 1987 .

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

[17]  Ari P. J. Vepsalainen.  Priority rules for job shops with weighted tardiness costs , 1987 .

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

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

[20]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

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