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

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129447, Issue , 1996, Pages 142-151

  Hall, Leslie A ^a   Shmoys, David B ^b   Wein, Joel ^c  

^a JOHNS HOPKINS UNIVERSITY   (United States)

^b Cornell University   (United States)

^c POLYTECHNIC UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BUSINESS MACHINES; LINEAR PROGRAMMING; POLYNOMIAL APPROXIMATION; SCHEDULING; SCHEDULING ALGORITHMS;

FRACTIONAL SOLUTIONS; IDENTICAL PARALLEL MACHINES; LINEAR PROGRAMMING FORMULATION; PERFORMANCE GUARANTEES; PRECEDENCE CONSTRAINTS; SINGLE MACHINE SCHEDULING PROBLEMS; TOTAL WEIGHTED COMPLETION TIME; WORST-CASE PERFORMANCE;

APPROXIMATION ALGORITHMS;

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

References (35)

1. Awerbuch, B., S. Kutten, D. Peleg (1992). Competitive distributed job scheduling. Proceedings of the 24th Annual ACM Symposium on 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 Theory of Computing, 163-171.
4. Crama, Y., F.C.R. Spieksma (1995). Scheduling jobs of equal length: complexity, facets, and computational results. Balas, E., J. Clausen, eds., Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science 920, Springer, Berlin, 277-291.
5. Deng, X., H. Liu, J. Long, B. Xiao (1990). Deterministic load balancing in computer networks, Proceedings of 2nd Annual IEEE Symposium on Parallel and Distributed Processing, 50-57.
6. 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.
7. Even, S., 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.
8. Graham, R.L. (1966). Bounds for certain multiprocessing anomalies. Bell System Tech. J. 45 1563-1581.
9. Graham, R.L., B.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.
10. Hall, L.A., A.S. Schulz, D.B. Shmoys, J. Wein (1995). Scheduling to minimize average completion time: off-line and on-line algorithms. In preparation.
11. 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.
12. Hochbaum, D.S., D.B. Shmoys (1988). A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach. SIAM J. Comput. 17 539-551.
13. 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.
14. Lenstra, J.K., D.B. Shmoys, É. Tardos (1990). Approximation algorithms for scheduling unrelated parallel machines. Math. Programming 46 259-271.
15. Lin, J.H., J.S. Vitter (1992). e-approximation with minimum packing constraint violation. Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 771-782.
16. Munier, A., J.C. König (1993). A heuristic for a scheduling problem with communication delays. Internal Report LRI 871, Université de Paris-sud, Orsay, France.
17. Phillips, C, C. Stein, J. Wein (1994). Task scheduling in networks. Proceedings of the Fourth Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science 824, Springer, Berlin, 290-301.
18. Phillips, C, C. Stein, J. Wein (1995). Scheduling jobs that arrive over time. Proceedings of the Fourth Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science 955, Springer, Berlin, 86-97.
19. Queyranne, M. (1995). Personal communication.
20. Queyranne, M., A.S. Schulz (1994). Polyhedral approaches to machine scheduling. Preprint 408/1994, Department of Mathematics, Technical University of Berlin, Berlin, Germany.
21. Queyranne, M., Y. Wang (1991a). Single-machine scheduling polyhedra with precedence constraints. Math. Oper. Res. 16 1-20.
22. Queyranne, M., Y. Wang (1991b). A cutting plane procedure for precedence-constrained single machine scheduling. Working paper, Faculty of Commerce, University of British Columbia, Vancouver, British Columbia.
23. Ravi, R., A. Agrawal, P. Klein (1991). Ordering problems approximated: single-processsor scheduling and interval graph completion. Proceedings of the 1991 International Colloquium on Automata, Languages and Processing, Lecture Notes in Computer Science 510, Springer, Berlin, 751-762.
24. Schulz, A.S. (1995a). Scheduling to minimize total weighted completion time: performance guarantees of LP-based heuristics and lower bounds. Draft of August 25, 1995.
25. Schulz, A.S. (1995b). Scheduling to minimize total weighted completion time: performance guarantees of LP based heuristics and lower bounds. Preprint 474/1995, Department of Mathematics, Technical University of Berlin, Berlin.
26. Shmoys, D.B., E. Tardos (1993). An approximation algorithm for the generalized assignment problem. Math. Programming 62 461-474.
27. Shmoys, D.B., J. Wein, D.P. Williamson (1995). Scheduling parallel machines on-line. SIAM J. Comput, to appear.
28. Smith, W. (1956). Various optimizers for single-stage production. Naval Res. Logist. Quart. 3 59-66.
29. Sousa, J.P., L.A. Wolsey (1992). A time-indexed formulation of non-preemptive single-machine scheduling problems. Math. Programming 54 353-367.
30. Trick, M. (1994). Scheduling multiple variable speed machines. Operations Research 42 234-248.
31. Van den Akker, J.M. (1994). LP-based solution methods for single-machine scheduling problems. PhD thesis, Eindhoven University of Technology, Eindhoven, Netherlands.
32. Van den Akker, J.M., C.P.M. Van Hoesel, M.W.P. Savelsbergh (1993). Facet-inducing inequalities for single-machine scheduling problems. Memorandum COSOR 93-27, Eindhoven University of Technology, Eindhoven, Netherlands.
33. Van den Akker, J.M., C.A.J. Hurkens, M.W.P. Savelsbergh (1995). A time-indexed formulation for sing le-machine scheduling problems: branch and cut. Preprint.
34. 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.
35. Wolsey, L.A. (1990). Formulating single machine scheduling problems with precedence constraints. Gabsewicz, J.J., 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.