Parallel machine scheduling considering a job-splitting property

International Journal of Production Research

Volumn 42, Issue 21, 2004, Pages 4531-4546

  Kim, Y D ^a   Shim, S O ^a   Kim, S B ^b   Choi, Y C ^a   Yoon, H M ^c  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^b Entrue Consulting Partners   (South Korea)

^c Dong Eui University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ANNEALING; COMPUTER SIMULATION; CONSTRAINT THEORY; HEURISTIC METHODS; JOB ANALYSIS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING;

ANNEALING ALGORITHMS; HEURISTICS ALGORITHMS; PARALLEL MACHINES; TARDINESS;

SCHEDULING;

EID: 8644252597     PISSN: 00207543     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207540410001720745     Document Type: Review

References (17)

1. ALIDAEE, B. and ROSA, D., 1997, Scheduling parallel machines to minimize total weighted and unweighted tardiness. Computers and Operations Research, 24, 775-788.
2. ARKIN, E. M. and ROUNDY, R. O., 1991, Weighted-tardiness scheduling on parallel machines with proportional weights. Operations Research, 39, 64-81.
3. AZIZOGLU, M. and KIRCA, O., 1998, Tardiness minimization on parallel machines. International Journal of Production Economics, 55, 163-168.
4. CHENG, T. and CHEN, Z., 1994, Parallel-machine scheduling problems with earliness and tardiness penalties. Journal of the Operational Research Society, 45, 685-695.
5. DOORAMACI, A. and SURKIS, J., 1979, Evaluation of a heuristic for scheduling independent jobs on parallel identical processors. Management Science, 25, 1208-1216.
6. ELMAGHRABY, S. E. and PARK, S. H., 1974, Scheduling jobs on a number of identical machines. AIIE Transactions, 6, 1-13.
7. HO, J. C. and CHANG, Y. L., 1991, Heuristics for minimizing mean tardiness for m parallel machines. Naval Research Logistics, 38, 367-381.
8. KIM, Y. D., 1987, On the superiority of a backward approach in list scheduling algorithms for multi-machine makespan problems. International Journal of Production Research, 25, 1751-1759.
9. KIM, Y. D., 1995, A backward approach in list scheduling algorithms for multi-machine tardiness problems. Computers and Operations Research, 22, 307-319.
10. KONDAKCI, S., AZIZOGLU, M. and KIRCA, O., 1994, An efficient algorithm for the single machine tardiness problem. International Journal of Production Economics, 36, 213-219.
11. KOULAMAS, C., 1997, Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem. Naval Research Logistics, 44, 109-125.
12. LEE, Y. H. and PINEDO, M., 1997, Scheduling jobs on parallel machines with sequence-dependent set-up times. European Journal of Operational Research, 100, 464-474.
13. PANWALKAR, S. S., SMITH, M. L. and KOULAMAS, C. P., 1993, A heuristic for the single machine tardiness problem. European Journal of Operational Research, 70, 304-310.
14. ROOT, J. G., 1965, Scheduling with deadlines and loss functions on k parallel machines. Management Science, 11, 460-475.
15. SERAFINI, P., 1996, Scheduling jobs on several machines with the job splitting property. Operations Research, 44, 617-628.
16. WILKERSON, L. J. and IRWIN, J. D., 1971, An improved algorithm for scheduling independent tasks. AIIE Transactions, 3, 239-245.
17. XING, W. and ZHANG, J., 2000, Parallel machine scheduling with splitting jobs. Discrete Applied Mathematics, 103, 259-269.