Scheduling to minimize average completion time: Off-line and on-line approximation algorithms

Mathematics of Operations Research

Volumn 22, Issue 3, 1997, Pages 513-544

  Hall, Leslie A ^a   Schulz, Andreas S ^b   Shmoys, David B ^c   Wein, Joel ^d  

^a JOHNS HOPKINS UNIVERSITY   (United States)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^c Cornell University   (United States)

^d POLYTECHNIC UNIVERSITY   (United States)

Author keywords

Approximation; Linear programming; On line algorithm; Scheduling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; LINEAR PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING; SCHEDULING;

JOB COMPLETION TIMES; LIST SCHEDULING RULES;

PRODUCTION CONTROL;

EID: 0031207982     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.22.3.513     Document Type: Article

References (52)

1. Awerbuch, B., S. Kutten, D. Peleg (1992). Competitive distributed job scheduling. Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, 571-581.
2. Balas, E. (1985). On the facial structure of scheduling polyhedra. Math. Programming Stud. 24 179-218.
3. Blum, A., P. Chalasani, D. Coppersmith, B. Pulleyblank, P. Raghavan, M. Sudan (1994). The minimum latency problem. Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, 163-171.
4. Bruno, J. L., E. G. Coffman, Jr., R. Sethi (1974). Scheduling independent tasks to reduce mean finishing time. Comm. ACM 17 382-387.
5. Chakrabarti, S., S. Muthukrishnan (1996). Job scheduling for practical parallel database and scientific applications. Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 329-335.
6. _, C. Phillips, A. S. Schulz, D. B. Shmoys, C. Stein, J. Wein (1996). Improved scheduling algorithms for minsum criteria. F. Meyer auf der Heide, B. Monien, eds., Automata, Languages, and Programming, Proceedings of the 23rd International Colloquium ICALP '96, Lecture Notes in Computer Science 1099, Springer, Berlin, 646-657.
7. Chekuri, C., R. Motwani, B. Natarajan, C. Stein (1997). Approximation techniques for average completion time scheduling. Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, 609-618.
8. Chudak, F., D. B. Shmoys (1997). Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds. Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, 581-590.
9. Deng, X., H. Liu, J. Long, B. Xiao (1990). Deterministic load balancing in computer networks. Proceedings of the 2nd Annual IEEE Symposium on Parallel and Distributed Processing, 50-57.
10. Dyer, M. E., L. A. Wolsey (1990). Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Appl. Math. 26 255-270.
11. Even, G., J. Naor, S. Rao, B. Schieber (1995). Divide-and-conquer approximation algorithms via spreading metrics. Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, 62-71.
12. Goemans, M. X. (1996). A supermodular relaxation for scheduling with release dates. W. H. Cunningham, S. T. McCormick, M. Queyranne, eds., Integer Programming and Combinatorial Optimization, Proceedings of the 5th International IPCO Conference, Lecture Notes in Computer Science 1084, Springer, Berlin, 288-300.
13. _ (1997). Improved approximation algorithms for scheduling with release dates. Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, 591-598.
14. Graham, R. L. (1966). Bounds for certain multiprocessing anomalies. Bell System Tech. J. 45 1563-1581.
15. _, E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5 287-326.
16. Hall, L. A., D. B. Shmoys, J. Wein (1996). Scheduling to minimize average completion time: off-line and online algorithms. Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, 142-151.
17. Hochbaum, D. S., D. B. Shmoys (1987). Using dual approximation algorithms for scheduling problems: practical and theoretical results. J. Assn. Comput. Mach. 34 144-162.
18. Ibarra, O. H., C. E. Kim (1975). Fast approximation algorithms for the knapsack and sum of subset problems. J. Assn. Comput. Mach. 22 463-468.
19. Kawaguchi, T., S. Kyan (1986). Worst case bound of an LRF schedule for the mean weighted flow-time problem. SIAM J. Comput. 15 1119-1129.
20. Kellerer, H., T. Tautenhahn, G. J. Woeginger (1996). Approximability and non-approximability results for minimizing total flow time on a single machine. Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, 418-426.
21. Lai, T-C. (1995). Earliest completion time and shortest remaining processing time sequencing rules. Preprint, College of Management, National Taiwan University.
22. Lenstra, J. K., A. H. G. Rinnooy Kan, P. Brucker (1977). Complexity of machine scheduling problems. Ann. Discrete Math. 1 343-362.
23. _, D. B. Shmoys, É. Tardos (1990). Approximation algorithms for scheduling unrelated parallel machines. Math. Programming 46 259-271.
24. Lin, J. H., J. S. Vitter (1992). ∈-approximation with minimum packing constraint violation. Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, 771-782.
25. Margot, F., M. Queyranne (1995). Personal communication.
26. th Annual European Symposium on Algorithms, Lecture Notes in Computer Science 1136, Springer Berlin, 76-90.
27. Munier, A., J. C. König (1997). A heuristic for a scheduling problem with communication delays. Oper. Res. 45 145-147.
28. Phillips, C., C. Stein, J. Wein (1994). Task scheduling in networks. E. M. Schmidt, S. Skyum, eds., Algorithm Theory - SWAT '94, Proceedings of the 4th Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science 824, Springer, Berlin, 290-301.
29. _, C. Stein, J. Wein (1995). Scheduling jobs that arrive over time. S. G. Akl, F. Dehne, J.-R. Sack, N. Santoro, eds., Algorithms and Data Structures, Proceedings of the 4th International Workshop WADS '95, Lecture Notes in Computer Science 955, Springer, Berlin, 290-301.
30. Potts, C. N. (1980). An algorithm for the single machine sequencing problem with precedence constraints. Math. Programming Stud. 13 78-87.
31. Queyranne, M. (1993). Structure of a simple scheduling polyhedron. Math. Programming 58 263-285.
32. _ (1995). Personal communication.
33. _, A. S. Schulz (1994). Polyhedral approaches to machine scheduling. Preprint No. 408/1994, Department of Mathematics, Technical University of Berlin, Berlin, Germany.
34. _, _ (1995). Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds. E. Balas, J. Clausen, eds., Integer Programming and Combinatorial Optimization, Proceedings of the 4th International IPCO Conference, Lecture Notes in Computer Science 920, Springer, Berlin, 307-320.
35. _, Y. Wang (1991). Single-machine scheduling polyhedra with precedence constraints. Math. Oper. Res. 16 1-20.
36. _, _ (1996). Personal communication.
37. Ravi, R., A. Agrawal, P. Klein (1991). Ordering problems approximated: single-processsor scheduling and interval graph completion. J. Leach Albert, B. Monien, M. Rodriguez Artalejo, eds., Automata, Languages and Programming, Proceedings of the 18th International Colloquium ICALP '91, Lecture Notes in Computer Science 510, Springer, Berlin, 751-762.
38. Schulz, A. S. (1996a). Scheduling and Polytopes. Ph.D. thesis, Technical University of Berlin, Berlin, Germany.
39. _ (1996b). Scheduling to minimize total weighted completion time: performance guarantees of LP-based heuristics and lower bounds. W. H. Cunningham, S. T. McCormick, M. Queyranne, eds., Integer Programming and Combinatorial Optimization, Proceedings of the 5th International IPCO Conference, Lecture Notes in Computer Science 1084, Springer, Berlin, 301-315.
40. _, M. Skutella (1996). Randomization strikes in LP-based scheduling : improved approximations for minsum criteria. Preprint 533/1996, Department of Mathematics, Technical University of Berlin, Berlin, Germany. To appear in Proceedings of the 5th Annual European Symposium on Algorithms.
41. _, M. Skutella (1996). Randomization strikes in LP-based scheduling : improved approximations for minsum criteria. Preprint 533/1996, Department of Mathematics, Technical University of Berlin, Berlin, Germany. To appear in Proceedings of the 5th Annual European Symposium on Algorithms.
42. Shmoys, D. B., E. Tardos (1993). An approximation algorithm for the generalized assignment problem. Math. Programming 62 461-474.
43. _, J. Wein, D. P. Williamson (1995). Scheduling parallel machines on-line. SIAM J. Comput. 24 1313-1331.
44. Smith, W. (1956). Various optimizers for single-stage production. Naval Res. Logist. Quart. 3 59-66.
45. Sousa, J. P., L. A. Wolsey (1992). A time-indexed formulation of non-preemptive single-machine scheduling problems. Math. Programming 54 353-367.
46. Trick, M. (1994). Scheduling multiple variable speed machines. Oper. Res. 42 234-248.
47. Van den Akker, J. M. (1994). LP-based solution methods for single-machine scheduling problems. Ph.D. thesis, Eindhoven University of Technology, Eindhoven, The Netherlands.
48. _, C. A. J. Hurkens, M. W. P. Savelsbergh (1995). A time-indexed formulation for single-machine scheduling problems: branch and cut. Preprint.
49. Wang, Y. (1996a). On the 3-approximation of scheduling with release dates. Technical Report, Max-Planck-Institut für Informatik, Saarbrücken, Germany.
50. _ (1996b). Bicriteria job scheduling with release dates. Technical Report, Max-Planck-Institut für Informatik, Saarbrücken, Germany.
51. Wolsey, L. A. (1985). Mixed integer programming formulations for production planning and scheduling problems. Invited talk at the 12th International Symposium on Mathematical Programming, MIT, Cambridge.
52. _ (1990). Formulating single machine scheduling problems with precedence constraints. J. J. Gabsewicz, J.-F. Richard, L. A. Wolsey, eds., Economic Decision Making: Games, Econometrics and Optimisation, Contributions in Honour of Jacques Dreze. North-Holland, Amsterdam, 473-484.