Scheduling one and two-processor tasks on two parallel processors

IIE Transactions (Institute of Industrial Engineers)

Volumn 31, Issue 5, 1999, Pages 445-455

  Lee, Chung Yee ^a   Cat, Xiaoqiang ^b  

^a Texas AandM University   (United States)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; HEURISTIC METHODS; POLYNOMIALS; PROBLEM SOLVING; PROCESS ENGINEERING;

PSEUDO-POLYNOMIAL TIME; TWO-PROCESSOR SCHEDULING METHOD;

SCHEDULING;

EID: 0032672426     PISSN: 0740817X     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1007501324572     Document Type: Article

References (29)

1. Krawczyk, H. and Kubale, M. (1985) An approximation algorithm for diagnostic test scheduling in multicomputer systems. IEEE Transactions on Computers, 34, 869-872.
2. Blazewicz, J.K., Drabowski, M. and Weglarz, J. (1986) Scheduling multiprocessor tasks to minimize schedule length. IEEE Transactions on Computers, C-35, 389-393.
3. Du, J. and Leung, J.Y.-T. (1989) Complexity of scheduling parallel task systems. SIAM Journal of Discrete Mathematics, 1, 473-487.
4. Kubale, M. (1987) The complexity of scheduling independent two-processor tasks on dedicated processors. Information Processing Letters, 24, 141-147.
5. Blazewicz, J.K., Dell'Olmo, P., Drozdowski, M. and Speranza, M.G. (1992) Scheduling multiprocessor tasks on three dedicated processors. Information Processing Letters, 41, 275-280.
6. Hoogeveen, J.A., van de Velde, S.L. and Deltman, B. (1994) Complexity of scheduling multiprocessor tasks with prespecified allocations. Discrete Applied Mathematics, 55, 259-272.
7. Bianco, L., Blazewicz, J., Dell'Olmo, P. and Drozdowski, M. (1993) Preemptive scheduling of multiprocessor task on the dedicated processor system subject to minimal lateness. Information Processing Letters, 46, 109-113.
8. Lee, C.-Y., Lei, L. and Pinedo, M. (1997) Current trends in deterministic scheduling. Annals of Operations Research, 70, 1-42.
9. Drozdowski, M. (1996) Scheduling multiprocessor tasks - an overview. European Journal of Operational Research, 94, 215230.
10. Blazewicz, J.K., Weglarz, J. and Drabowski, W. (1984) Scheduling independent 2-processor tasks to minimize scheduling length. Information Processing Letters, 18, 267-273.
11. Plehn, J. (1990) Preemptive scheduling of independent jobs with release times and deadlines on a hypercube. Information Processing Letters, C-3-J, 161-166.
12. Allahverdi, A., Gupta, J.D.N. and Aldowaisan, T. (1998) A review of scheduling research involving setup considerations. OMEGA, The International Journal of Management Science, (in press).
13. Graham, R.I., Lawler, E.L., Lenstra, J.K. and Rinnooy Kan, A.H.G. (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287-326.
14. Pinedo, M. (1995) Scheduling: Theory, Algorithms, and Systems, Prentice Hall, Englewood Cliffs, NJ.
15. Veitmann, B., Lageweg, B.J. and Lenstra, J.K. (1990) Multiprocessor scheduling with communication delays. Parallel Computing, 16, 173-182.
16. Bruno, J.D., Coffman, Jr., E.G. and Sethi, R. (1974) Scheduling independent tasks to reduce mean finishing time. Communications of the ACM, 17, 382-387.
17. Garey, M.R. and Johnson, D.S. (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, New York.
18. Lawler, E.L. and Moore, J.M. (1969) A functional equation and its application to resource allocation and scheduling problems. Management Science, 16, 77-84.
19. Lee, C.-Y. and Uzsoy, R. (1992) A new dynamic programming algorithm for the parallel machine total weighted completion time problem. Operations Research Letters, 11, 73-75.
20. Barnes, J.W. and Brennan, J.J. (1977) An improved algorithm for scheduling jobs on identical machines. AIIE Transactions, 9, 2531.
21. Sarin, S.C., Ahn, A. and Bishop, A.B. (1988) An improved branching scheme for the branch and bound procedure of scheduling n jobs on M parallel machines to minimize total weighted flowtime. International Journal of Production Research, 26, 1183-1191.
22. Sahni, S. (1976) Algorithms for scheduling independent tasks. Journal of the ACM, 23, 116-127.
23. Kawaguchi, T. and Kyan, S. (1986) Worst case of an LRF schedule for the mean weighted flow-time problem. SIAM J. Compiit., 15, 1119-1129.
24. Lawler, E.L. (1973) Optimal sequencing of a single machine subject to precedence constraints. Management Science, 19, 544546.
25. Baker, K.R. and Su, Z.-S. (1974) Sequencing with due dates and early start times to minimize maximum tardiness. Naval Research Logistics Quarterly, 21, 171-176.
26. McMahon, G. and Florian, M. (1975) On scheduling with ready times and due dates to minimize maximum lateness. Operations Research, 23, 475-482.
27. Carlier, J. (1982) The one-machine sequencing problem. European Journal of Operational Research, 11, 42-47.
28. Potts, C.N. (1980) Analysis of a heuristic for one machine sequencing with release dates and delivery times. Operations Research, 28, 1436-1441.
29. Hall, L. and Shmoys, D. (1992) Jackson's rule for one-machine scheduling: making a good heuristic better. Mathematics of Operations Research, 17, 22-35.