Due-date setting methodologies based on simulated annealing—an experimental study in a real-life job shop

In this article we present a real-life study of a job shop manufacturing ball screws. The aim of the study is to suggest an efficient scheduling and due-date setting policy for the shop. Three different methodologies for setting parameter coefficients for due-date setting in a job shop are proposed. These methodologies are based on a search algorithm, simulated annealing algorithm, and a combination of simulated annealing algorithm and regression analysis. It is found that the combination of a simulated annealing algorithm with regression analysis provides better due-date estimates in minimizing the root mean square of lateness.

[1]  Robert Hooke,et al.  `` Direct Search'' Solution of Numerical and Statistical Problems , 1961, JACM.

[2]  Samuel Eilon,et al.  Due dates in job shop scheduling , 1976 .

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

[4]  Jwm Will Bertrand,et al.  A comparison of due-date selection rules , 1981 .

[5]  Jack C. Hayya,et al.  Priority dispatching with operation due dates in a job shop , 1982 .

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

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

[8]  Jwm Will Bertrand,et al.  The use of workload information to control job lateness in controlled and uncontrolled release production systems , 1983 .

[9]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

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

[11]  Gary L. Ragatz,et al.  A framework for the study of due date management in job shops , 1984 .

[12]  Peter O'Grady,et al.  A general search sequencing rule for job shop sequencing , 1985 .

[13]  T. L. Ward,et al.  Solving Quadratic Assignment Problems by ‘Simulated Annealing’ , 1987 .

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

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

[16]  Spyros Makridakis,et al.  Forecasting Methods for Management , 1989 .

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

[18]  Ranga V. Ramasesh.  Dynamic job shop scheduling: A survey of simulation research , 1990 .

[19]  Kevin J. Dooley,et al.  Dynamic rules for due-date assignment , 1991 .

[20]  T. S. Raghu,et al.  An efficient dynamic dispatching rule for scheduling in a job shop , 1993 .

[21]  Chandrasekharan Rajendran,et al.  Scheduling in a cellular manufacturing system: a simulated annealing approach , 1993 .