A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem

The present paper reports on a new approach to applying simulated annealing to the flow shop scheduling problem with early/tardy costs. This approach incorporates the simulated annealing methodology with problem-specific knowledge, which is given in a table called the ‘Backward-Forward Exchange Priority Table’. Performance of the proposed method is tested on randomly generated problems and is compared to those of two formal simulated annealing schemes. Finally, it is shown that solutions obtained by the proposed method are superior to those of formal annealing schemes.

[1]  Yih-Long Chang,et al.  MINIMIZING MEAN ABSOLUTE DEVIATION OF COMPLETION TIMES ABOUT A COMMON DUE DATE. , 1986 .

[2]  J. Blackstone,et al.  Minimizing Weighted Absolute Deviation in Single Machine Scheduling , 1987 .

[3]  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..

[4]  F. Rendl,et al.  A thermodynamically motivated simulation procedure for combinatorial optimization problems , 1984 .

[5]  Richard W. Eglese,et al.  Conference Seminar Timetabling , 1987 .

[6]  Kenji Itoh,et al.  Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge , 1995 .

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

[8]  Mike Wright.  Applying Stochastic Algorithms to a Locomotive Scheduling Problem , 1989 .

[9]  Kenji Itoh,et al.  SIMULATED ANNEALING SCHEME INCORPORATING MOVE DESIRABILITY TABLE FOR SOLUTION OF FACILITY LAYOUT PROBLEMS , 1995 .

[10]  Wen-Chyuan Chiang,et al.  A simulated annealing procedure for single row layout problems in flexible manufacturing systems , 1992 .

[11]  Thomas E. Morton,et al.  The single machine early/tardy problem , 1989 .

[12]  Xie Ping,et al.  Flow-shop scheduling by the knowledge of statistical mechanics and annealing , 1987, 26th IEEE Conference on Decision and Control.

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

[14]  David Connolly.  An improved annealing scheme for the QAP , 1990 .

[15]  Jeffrey B. Sidney,et al.  Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties , 1977, Oper. Res..

[16]  V. Srinivasan.  A hybrid algorithm for the one machine sequencing problem to minimize total tardiness , 1971 .

[17]  Chris N. Potts,et al.  Single Machine Tardiness Sequencing Heuristics , 1991 .

[18]  Mesbah U. Ahmed,et al.  Minimizing the Weighted Sum of Late and Early Completion Penalties in a Single Machine , 1990 .

[19]  B. Golden,et al.  Using simulated annealing to solve routing and location problems , 1986 .

[20]  Peng Si Ow,et al.  Focused Scheduling in Proportionate Flowshops , 1985 .

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