A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems

International Journal of Systems Science

Volumn 31, Issue 4, 2000, Pages 537-542

  Wang, Tai Yue ^a   Wu, Kuei Bin ^b  

^a NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

^b YUNG TA INSTITUTE OF TECHNOLOGY AND COMMERCE   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; PROBLEM SOLVING; SIMULATED ANNEALING;

JOB SHOP SCHEDULING;

SCHEDULING;

EID: 0034175299     PISSN: 00207721     EISSN: 14645319     Source Type: Journal    
DOI: 10.1080/002077200291118     Document Type: Article

References (20)

1. Anderson, E. J., and Nyirenda, J. C., 1990, Two new rules to minimize tardiness in a job shop. International Journal of Production Research, 28, 2277-2292.
2. Baker, K. R., 1984, Sequencing rules and due-date assignments in a job shop. Management Science, 30, 1093-1104.
3. Baker, K. R., and Kanet, J. J., 1983, Job shop scheduling with modified due dates. Journal of Operations Management, 4, 11-22.
4. Ben-Daya, M and Al-Fawzan, M., 1996, A simulated annealing approach for the one-machine mean tardiness scheduling problem. European Journal of Operational Research, 93, 61-67.
5. Eglese, R. W., 1990, Simulated annealing: a tool for operational research. European Journal of Operational Research, 46, 271-281.
6. Gary, M. R., and Johnson, D. S., 1979, Computers and Intractability: A Guide to the Theory of NP-Completeness (New York: W. H. Freeman).
7. He, Z., Yang, T., and Deal, D. E., 1993, A multiple-pass heuristic rule for job shop scheduling with due dates. International Journal of Production Research, 31, 2677-2692.
8. Ishibuchi, H., Misaki, S., and Tanaka, H., 1995, Modified simulated annealing algorithms for the flow shop sequencing problem. European Journal of Operational Research, 81, 388-398.
9. Kanet, J. J., and Hayya, J. C., 1982, Priority dispatching with operation due dates in a job shop. Journal of Operations Management, 2, 167-175.
10. Kirkpatrick, S., Gelatt, C. D., and Vecchi, M. P., 1983, Optimization by simulated annealing. Science, 220, 671-680.
11. Park, M. W., and Kim, Y. D., 1998, A systematic procedure for setting parameters in simulated annealing algorithms. Computers and Operations Research, 25, 207-217.
12. Pirlot, M., 1996, General local search methods. European Journal of Operational Research, 92, 493-511.
13. Rutenbar, R. A., 1989, Simulated annealing algorithms: an overview. IEEE Circuits and Devices Magazine, January, 19-26.
14. Sridhar, J., and Rajendran, C., 1993, Scheduling in a cellular manufacturing system: a simulated annealing approach. International Journal of Production Research, 31, 2927-2945.
15. Tan, K. C., and Narasimhan, R., 1997, Minimizing tardiness on a single processor with sequence-dependent setup times: a simulated annealing approach. Omega, 25, 619-634.
16. Van Laarhoven, P. J. M., Aarts, E. H. L., and Lenstra, J. K., 1992, Job shop scheduling by simulated annealing. Operations Research, 40, 113-125.
17. Wang, T. Y., and Wu, K. B., 1999a, An efficient configuration generation mechanism to solve job shop scheduling problems by the simulated annealing algorithm. International Journal of Systems Science, 30, 527-532; 1999b, A parameter set design procedure for the simulated annealing algorithm under the computational time constraint. Computers and Operations Research, 26, 665-678.
18. Wang, T.Y., Lin, H. C., and Wu, K. B., 1998, An improved simulated annealing for facility layout problems in cellular manufacturing systems. Computers and Industrial Engineering, 34, 309-319.
19. Weeks, J. K., 1979, A simulation study of predictable due-dates. Management Science, 25, 363-373.
20. Zegordi, S. H., Itoh, K., and Enkawa, T., 1995, Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge. European Journal of Operational Research, 85, 515-531.