Existence theorems, lower bounds and algorithms for scheduling to meet two objectives

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 723-731

  Rasala, April ^a   Stein, Cliff ^b   Torng, Eric ^c   Uthaisombut, Patchrawat ^d  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b Department of Earth and Environmental Sciences   (United States)

^c Michigan State University   (United States)

^d Learning Research and Development Ctr   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

AVERAGE FLOWS; COMPLETION TIME; CONSTANT FACTORS; EXISTENCE RESULTS; EXISTENCE THEOREM; LOWER BOUNDS; MAXIMUM FLOWS; MAXIMUM LATENESS;

SCHEDULING ALGORITHMS;

EID: 84951960282     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. J. A. Aslam, A. Rasala, C. Stein, and N. Young. Improved bicriteria existence theorems for scheduling. In Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, 1999. To appear.
2. S. Chakrabarti, C. A. Phillips, A. S. Schulz, D. B. Shmoys, C. Stein, and J. Wein. Improved scheduling algorithms for minsum criteria. In F. Meyer auf der Heide and B. Monien, editors, Automata, Languages and Programming, number 1099 in Lecture Notes in Computer Science. Springer, Berlin, 1996. Proceedings of the 23rd International Colloquium (ICALP'96).
3. C. Chekuri, R. Motwani, B. Natarajan, and C. Stein. Approximation techniques for average completion time scheduling. In Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms, pages 609-618, January 1997. To appear in SIAM J. Computing.
4. R.W. Conway, W.L. Maxwell, and L.W. Miller. Theory of Scheduling. Addison-Wesley, 1967.
5. R.L. Graham. Bounds for certain multiprocessor anomalies. Bell System Technical Journal, 45:1563-1581, 1966.
6. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5:287-326, 1979.
7. L. A. Hall, A. S. Schulz, D. B. Shmoys, and J. Wein. Scheduling to minimize average completion time: Offline and on-line approximation algorithms. Mathematics of Operations Research, 22:513-544, August 1997.
8. J. A. Hoogeveen. Minimizing maximum promptness and maximum lateness on a single machine. Mathematics of Operations Research, 21:100-114, 1996.
9. J. A. Hoogeveen. Single-machine scheduling to minimize a function of two or three maximum cost criteria. Journal of Algorithms, 21(2):415-433, 1996.
10. J. A. Hoogeveen and S.L. van de Velde. Mmimizing total completion time and maximum cost simulatneously is solvable in polynomial time. Operations Research Letters, 17:205-208, 1995
11. C.A.J. Hurkens and M.J. Coster. On the makespan of a schedule minimizing total completion time for unrelated parallel machines. Unpublished manuscript, 1996.
12. David Karger, Cliff Stein, and Joel Wein. CRC Handbook on Algorithms, chapter Scheduling Algorithms. CRC Press, 1998.
13. T. Kawaguchi and S. Kyan. Worst case bound of an LRF schedule for the mean weighted flow-time problem. SIAM Journal on Computing, 15:1119-1129, 1986.
14. E.L. Lawler. Optimal sequencing of a single machine subject to precedence constraints. Management Science, 19:544-546, 1973
15. E.L. Lawler, J.K. Lenstra, A.H.G. Rinooy Kan, and D.B-Shmoys. Sequencing and scheduling: Algorithms and complexity. In S.C. Graves, A.H.G. Rinnooy Kan, and P.H. Zipkin, editors, Handbooks in Operations Research and Management Science, Vol 4-, Logistics of Production and Inventory, pages 445-522. North-Holland, 1993.
16. S.T. McCormick and M.L. Pinedo. Scheduling n independent jobs on m uniform machines with both flow time and makespan objectives: A parametric approach. ORSA Journal of Computing, 7:63-77, 1992.
17. R.T. Nelson, R.K. Sarin, and R.L. Daniels. Scheduling with multiple performance measures: the one-machine case. Management Science, 32:464-479, 1986.
18. C. Phillips, C. Stein, and J. Wein. Minimiaing average completion time in the presence of release dates. Mathematical Programming, 82:199-223, 1998.
19. M. Pinedo. Scheduling: Theory, Algorithms and Systems. Prentice Hail, 1995.
20. A. Rasala. Existence theorems for scheduling to meet two objectives. Technical Report PCS-TR99-347, Department of Computer Science, Dartmouth College, 1999.
21. D. B. Shmoys and E. Tardos. An approximation algorithm for the generalized assignment problem. Mathematical Programming A, 62:461-474, 1993.
22. W.E. Smith. Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3:59-66, 1956.
23. C. Stein and J. Wein. On the existence of schedules that are near-optimal for both makespan and total weighted completion time. Operations Research Letters, 21, 1997.
24. L.N. Van Wassenhove and F. Gelders. Solving a bicriterion scheduling problem. European Journal of Operations Research, 4:42-48, 1980.