An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling

Abstract The generalized job shop scheduling (GJSS) problem with due dates is considered. Herein the objective is to minimize total job tardiness. An effective heuristic algorithm referred to as the Enhanced Exchange Heuristic Algorithm (EEHA) is presented for solving this type of problem. This algorithm integrates simulated annealing and the exchange heuristic algorithm by employing an insertion technique. It is shown that the algorithm is completed in polynomial time. Experimental results, generated over a range of shop sizes with different due date tightness, indicate that the proposed technique is competent to attain significant reductions in total tardiness in relation to initial schedules for relatively large-sized problems. Therefore, we would suggest that the approach presents an efficient scheduling alternative for this class of complex optimization problems.

[1]  Edward Anderson,et al.  Two new rules to minimize tardiness in a job shop , 1990 .

[2]  Nabil R. Adam,et al.  Note---A Comparison of Capacity Planning Techniques in a Job Shop Control System , 1977 .

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

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

[5]  Teofilo F. Gonzalez,et al.  Flowshop and Jobshop Schedules: Complexity and Approximation , 1978, Oper. Res..

[6]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

[7]  G. Ragatz,et al.  A simulation analysis of due date assignment rules , 1984 .

[8]  Vincent A. Mabert,et al.  Evaluating project scheduling and due date assignment procedures: an experimental analysis , 1988 .

[9]  Kenneth R. Baker,et al.  Job shop scheduling with modified due dates , 1983 .

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

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

[12]  Robert L. Bulfin,et al.  Simulated annealing for resource-constrained scheduling , 1993 .

[13]  Hirofumi Matsuo,et al.  A controlled search simulated annealing method for the single machine weighted tardiness problem , 1990 .

[14]  James K. Weeks.  A Simulation Study of Predictable Due-Dates , 1979 .

[15]  Taeyong Yang,et al.  AN EXCHANGE HEURISTIC FOR GENERALIZED JOB SHOP SCHEDULING , 1989 .

[16]  J. Bertrand.  The Effect of Workload Dependent Due-Dates on Job Shop Performance , 1983 .

[17]  Taeyong Yang,et al.  An algorithm for the scheduling of army battalion training exercises , 1987, Comput. Oper. Res..

[18]  Richard W. Eglese,et al.  Simulated annealing: A tool for operational research , 1990 .

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

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

[21]  Taeyong Yang,et al.  AN EXCHANGE HEURISTIC ALGORITHM FOR PROJECT SCHEDULING WITH LIMITED RESOURCES , 1989 .

[22]  David K. Smith,et al.  The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem , 1990, Comput. Oper. Res..

[23]  Kenneth R. Baker,et al.  Sequencing Rules and Due-Date Assignments in a Job Shop , 1984 .

[24]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[25]  Taeyong Yang,et al.  A MULTIPLE-PASS HEURISTIC RULE FOR JOB-SHOP SCHEDULING WITH DUE-DATES , 1993 .

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

[27]  John S. Gero,et al.  ARCHITECTURAL OPTIMIZATION-A REVIEW , 1975 .