Tabu search for minimizing total tardiness in a job shop

International Journal of Production Economics

Volumn 63, Issue 2, 2000, Pages 131-140

  Amaral Armentano, Vinícius ^a   Rigão Scrich, Cintia ^a  

^a UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; CRITICAL PATH ANALYSIS; HEURISTIC METHODS; PROCESS ENGINEERING; SCHEDULING; STATISTICAL METHODS;

JOB SHOP SCHEDULING; TABU SEARCH METHOD;

PRODUCTION CONTROL;

EID: 0342592297     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-5273(99)00014-6     Document Type: Article

References (25)

1. Balas E. Machine sequencing via disjunctive graphs: an implicit enumeration algorithm. Operations Research. 17:1969;941-957.
2. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, Sequencing and scheduling: Algorithms and complexity, in: S.C. Graves, A.H.G. Rinnooy Kan, P.H. Zipkin (Eds.), Logistics of Production and Inventory, North-Holland, Amsterdam, pp. 445-522.
3. Dell'Amico M., Trubian M. Applying tabu search to the job-shop scheduling problem. Annals of Operations Research. 41:1993;231-252.
4. Taillard E.D. Parallel taboo search techniques for the job shop scheduling problem. ORSA Journal on Computing. 6:1994;108-117.
5. Barnes J.W., Chambers J.B. Solving the job shop scheduling problem with tabu search. IIE Transactions. 27:1995;257-263.
6. Nowicki E., Smutnicki C. A fast taboo search algorithm for the job shop problem. Management Science. 42:1996;797-813.
7. Van Laarhoven P.J.M., Aarts E.H.L., Lenstra J.K. Job shop scheduling by simulated annealing. Operations Research. 40:1992;113-125.
8. Dagli C.H., Sittisathanchai S. Genetic neuro-scheduler. A new approach for job shop scheduling International Journal of Production Economics. 41:1995;135-145.
9. Della Croce F.D., Tadei R., Volta G. A genetic algorithm for the job shop problem. Computers & Operations Research. 22:1995;15-24.
10. Adams J., Balas E., Zawack D. The shifting bottleneck procedure for job shop scheduling. Management Science. 34:1988;391-401.
11. Applegate D., Cook W. A computational study of the job-shop scheduling problem. ORSA Journal on Computing. 3:1991;149-156.
12. Kanet J.J., Hayya J.C. Priority dispatching with operation due dates in a job shop. Journal of Operations Management. 2:1982;167-175.
13. Baker K.R., Kanet J.J. Job shop scheduling with modified due dates. Journal of Operations Management. 4:1983;11-22.
14. Baker K.R. Sequencing rules and due date assignments in a job shop. Management Science. 30:1984;1093-1104.
15. Vepsalainen A.P.J., Morton T.E. Priority rules for job shops with weighted tardiness costs. Management Science. 33:1987;1035-1047.
16. Anderson E.J., Nyirenda J.C. Two new rules to minimize tardiness in a job shop. International Journal of Production Research. 28:1990;2277-2292.
17. He Z., Yang T., Deal D.E. A multiple-pass heuristic rule for job shop scheduling with due dates. International Journal of Production Research. 31:1993;2677-2692.
18. Raman N., Talbot F.B. The job shop tardiness problem: A decomposition approach. European Journal of Operational Research. 69:1993;187-199.
19. Glover F. Tabu search. Part I ORSA Journal on Computing. 1:1989;190-206.
20. Glover F. Tabu search. Part II ORSA Journal on Computing. 2:1990;4-32.
21. Glover F., Laguna M. Tabu Search. 1997;Kluwer Publishers, Boston.
22. Brandimarte P. Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research. 41:1993;157-183.
23. Chakrapani J., Skorin-Kapov J. Massively parallel tabu search for the quadratic assignment problem. Annals of Operations Research. 41:1993;327-341.
24. Kelly J.P., Laguna M., Glover F. A study of diversification strategies for the quadratic assignment problem. Computers and Operations Research. 21:1994;885-893.
25. Baker K.R. Introducing to Sequencing and Scheduling. 1974;Wiley, New York.