Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints

Computers and Operations Research

Volumn 36, Issue 3, 2009, Pages 698-710

  Kim, Eun Seok ^a   Sung, Chang Sup ^a   Lee, Ik Sun ^b  

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

^b Dong A University   (South Korea)

Author keywords

Heuristic; Parallel machine scheduling; Precedence constraints; Total completion time

Indexed keywords

BUSINESS MACHINES; SCHEDULING;

HEURISTIC; PARALLEL MACHINE SCHEDULING; PRECEDENCE CONSTRAINTS; TOTAL COMPLETION TIME;

HEURISTIC METHODS;

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

References (22)

1. Kim ES, Posner, ME. Parallel machine scheduling with s-precedence constraints, 2007, submitted for publication.
2. Lawler E.L. Sequencing jobs to minimize total weighted completion time. Annals of Discrete Mathematics 2 (1978) 75-90
3. Horn W.A. Single-machine job sequencing with treelike precedence ordering and linear delay penalties. SIAM Journal on Applied Mathematics 23 (1972) 189-202
4. Adolphson D., and Hu T.C. Optimal linear ordering. SIAM Journal on Applied Mathematics 25 (1973) 403-423
5. Sidney J.B. Decomposition algorithms for single-machine sequencing with precedence relations and deferral costs. Operations Research 23 (1975) 283-298
6. Chekuri C., and Motwani R. Precedence constrained scheduling to minimize sum of weighted completion times on a single machine. Discrete Applied Mathematics 98 (1999) 29-38
7. Chudak F., and Hochbaum D. A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine. Operations Research Letters 25 (1999) 199-204
8. Du J., Leung J.Y.-T., and Young G.H. Scheduling chain-structured tasks to minimize makespan and mean flow time. Information and Computation 92 (1991) 219-236
9. Nilson N.J. Principles of artificial intelligence (1980), Tioga, Palo Alto, CA
10. Chang J., and Hsu C. Task scheduling with precedence constraints to minimize the total completion time. International Journal Systems Science 26 (1995) 2203-2217
11. Dror M., Kubiak W., and Dell'Olmo P. Scheduling chains to minimize mean flow time. Information Processing Letters 61 (1997) 297-301
12. Hall L.A., Schulz A.S., Shmoys D.B., and Wein J. Scheduling to minimize average completion time: offline and online algorithms. Mathematics of Operations Research 22 (1997) 513-544
13. Ramachandra G., and Elmaghraby S.E. Sequencing precedence-related jobs on two machines to minimize the weighted completion time. International Journal of Production Economics 100 (2006) 44-58
14. Queyranne M., and Schulz A.S. Approximation bounds for a general class of precedence constrained parallel machine scheduling problems. SIAM Journal on Computing 35 (2006) 1241-1253
15. Graham R.L. Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics 17 (1969) 416-429
16. Smith W.E. Various optimizer for single stage production. Naval Research Logistics Quartely 3 (1956) 59-66
17. Conway R.W., Maxwell W.L., and Miller L.W. Theory of scheduling (1967), Addison-Wesley, Reading, MA
18. Graham R.L. Bounds for certain multiprocessing anomalies. Bell System Technical Journal 45 (1966) 1563-1581
19. Schulz AS. Scheduling to minimize total weighted completion time: performance guarantees of LP-based heuristics and lower bounds. In: Cunningham WH, McCormick ST, Queyranne M, editors. Integer programming and combinatorial optimization. Lecture notes in computer science, vol. 1084. Berlin: Springer; 1996. p. 119-33.
20. Hall N.G., and Posner M.E. Generating experimental data for computational testing with machine scheduling applications. Operations Research 49 (2001) 854-865
21. Garey M.R., and Johnson D.S. Computers and intractability: a guide to the theory of NP-completeness (1979), Freeman, San Francisco, CA
22. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic machine scheduling: A survey. Annals of Discrete Mathematics 5 (1979) 287-326