Parallel machine selection and job scheduling to minimize machine cost and job tardiness

Computers and Operations Research

Volumn 32, Issue 8, 2005, Pages 1995-2012

  Cao, Dong ^a,b   Chen, Mingyuan ^a,b   Wan, Guohua ^a,b  

^a Gina Cody School of Engineering and Computer Science   (Canada)

^b UNIVERSITY OF MACAU   (Macao)

Author keywords

Machine selection; Optimization; Parallel machine scheduling; Tabu search

Indexed keywords

ALGORITHMS; COST ACCOUNTING; HEURISTIC METHODS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; SCHEDULING;

JOB SCHEDULING; MACHINE SELECTION; PARALLEL MACHINE SCHEDULING; TABU SEARCH;

COMPUTER NETWORKS;

EID: 10644241667     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2004.01.001     Document Type: Article

References (20)

1. Sivrikaya F, Ulusoy G. Parallel machine scheduling with earliness and tardiness penalties. Computers and Operations Research 1999;26:773-87.
2. Azizoglu M, Kirca O. Scheduling jobs on unrelated parallel machines to minimize regular total cost function. IIE Transactions 1999;31:153-9.
3. Bilge U, Kirac F, Kurtulan M, Pekgun P. A Tabu search algorithm for parallel machine total tardiness problem. Computers and Operations Research 2004;31:397-414.
4. Liaw C, Lin Y, Cheng C, Chen M. Scheduling unrelated parallel machines to minimize total weighted tardiness. Computers and Operations Research 2003;30:1777-89.
5. Cao D, Chen M. Parallel flowshop scheduling using Tabu search. I International Journal of Production Research 2003;41:3059-73.
6. Baker K, Scudder G. Sequencing with earliness and tardiness penalties: a review. Operations Research 1990;38:22-36.
7. Sen T, Sulek J, Dileepan P. Static scheduling research to minimize weighted and unweighted tardiness: a state-of-the-art survey. International Journal of Production Economics 2003;83:1-12.
8. Koulamas C. The total tardiness problem: review and extensions. Operations Research 1994;42:1025-41.
9. Alidaee B, Rosa D. Scheduling parallel machines to minimize total weighted and unweighted tardiness. Computers and Operations Research 1997;24:775-88.
10. Lenstra JK, Rinnoy Kan A, Brucker P. Complexity of machine scheduling problems. Annals Discrete Mathematics 1977;1:343-77.
11. Du J, Leung J. Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research 1990;15:483-95.
12. Baker K, Bertrand J. A dynamic priority rule for sequencing against due-dates. Journal of Operational Management 1982;3:37-42.
13. Radhakrishnan S, Ventura J. Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times. International Journal of Production Research 2000;38:2233-52.
14. Schrage L. Optimization modeling with LINGO. Chicago, IL: LINDO Systems Inc., 2002.
15. Glover F. Tabu search: part I. ORSA Journal on Computing 1989;1:190-206.
16. Glover F. Tabu search: part II. ORSA Journal on Computing 1990;2:4-32.
17. Glover F, Laguna M, Tabu search. Dordrecht, The Netherlands: Kluwer Academic Publishers; 1997.
18. Sule D. Industrial scheduling. Boston: PWS Pub. Co.; 1997.
19. Salhi S. Defining Tabu list size and aspiration criterion with Tabu search method. Computers and Operations Research 2002;29:67-86.
20. Pinedo M. Scheduling: theory, algorithms, and systems. Englewood Cliffs, NJ: Prentice-Hall; 1995.