Schedule evaluation: simulation optimization for process scheduling through simulated annealing

ABSTRACT

This paper presents a simulation optimization of a real scheduling problem in industry, simulated annealing is introduced for this purpose. Investigation is performed into the practicality of using simulated annealing to produce high quality schedules. Results on the solution quality and computational effort show the inherent properties of the simulated annealing. It is shown that when using this method, high quality schedules can be produced within reasonable time constraints.

REFERENCES

• 1: Aarts, E. H. L., P. J. M. Van Laarhoven, J. K. Lenstra, N. and L. J. Ulder. 1994. A computational Study of Local Search Algorithms for Job Shop Scheduling. ORSA Journal on Computing 5:118--125.
• 2: Choi, C. W. 2000. An Overview of Solving Job Shop Scheduling Problem by Local Search Techniques. National University of Singapore, Singapore.
• 3: Hao, J. and R. Dorne. 1996. Empirical Studies of Heuristic Local Search for Constraint Solving. In Lecture Notes in Computer Science: Springer
• 4: Hopp, W. J. and M. L. Spearman. 1996. Factory Physics: Irwin. McGraw-Hill.
• 5: Huchison, J. 1990. Current and Future Issues Concerning FMS Scheduling. OMEGA International Journal of Management Science 19 (6):529--537.
• 6: Jain, A. and S. Meeran. 1998. A state of the art review of job-shop scheduling Techniques. University of Dundee, Dundee, Scotland.
• 7: Jones, A. and L. C. Rabelo. 1998. Survey of Job Scheduling Techniques. Gaithersburg, MD: National Institute of Standards and Technology.
• 8: Kirkpatrick, S., C. D. Gelatt Jr. and M. P. Vecchi. 1982. Optimization by Simulated Annealing. IBM Research Report RC 9355.
• 9: Metropolis, N., A. Rosenbluth, M. Rosenbluth, A. Teller and E. Teller. 1953. Equation of State Calculations by Fast Computing Machines. J. of Chem. Physics 21.
• 10: Srinivasaraghavan Parthasarathy , Chandrasekharan Rajendran, Scheduling to minimize mean tardiness and weighted mean tardiness in flowshop and flowline-based manufacturing cell, Computers and Industrial Engineering, v.34 n.2, p.531-546, April 1998 [doi>10.1016/S0360-8352(97)00139-3]
• 11: F. Riane , C. Raczy , A. Artiba, Hybrid auto-adaptable simulated annealing based heuristic, Computers and Industrial Engineering, v.37 n.1-2, p.277-280, Oct. 1999 [doi>10.1016/S0360-8352(99)00073-X]
• 12: Alex J. Ruiz-Torres , E. Emory Enscore , Russell R. Barton, Simulated annealing heuristics for the average flow-time and the number of tardy jobs bi-criteria identical parallel machine problem, Proceedings of the 21st international conference on Computers and industrial engineering, p.257-260, December 1997, San Juan, Puerto Rico
• 13: Vaessens, R. J. H., E. H. L. Aarts and J. K. Lenstra. 1995. Job Shop Scheduling by Local Search. Eindhoeven: University of Technology.
• 14: P. J. M. Laarhoven , E. H. L. Aarts, Simulated annealing: theory and applications, Kluwer Academic Publishers, Norwell, MA, 1987