On the asymptotic optimality of a simple on-line algorithm for the stochastic single-machine weighted completion time problem and its extensions

Operations Research

Volumn 54, Issue 3, 2006, Pages 464-474

  Chou, Mabel C ^a   Liu, Hui ^b   Queyranne, Maurice ^c   Simchi Levi, David ^d  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b Verizon Laboratories   (United States)

^c UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^d Massachusetts Institute of Technology Cambridge   (United States)

Author keywords

Production scheduling: on line single machine and flow shop stochastic sequencing

Indexed keywords

PROCESSING TIME; PRODUCTION/SCHEDULING: ON-LINE SINGLE-MACHINE AND FLOW SHOP STOCHASTIC SEQUENCING; SCHEDULING DECISION; STOCHASTIC FLOW;

ALGORITHMS; HEURISTIC METHODS; MATHEMATICAL MODELS; ONLINE SYSTEMS; PROBLEM SOLVING; RANDOM PROCESSES; SCHEDULING;

JOB ANALYSIS;

EID: 33744828313     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1060.0270     Document Type: Article

References (18)

1. Bertsimas, D., D. Gamarnik, J. Sethuraman. 2003. From fluid relaxations to practical algorithms for high-multiplicity job-shop scheduling: The holding cost objective. Oper. Res. 51(5) 798-813.
2. Chang, C. S., D. D. Yao. 1993. Rearrangement, majorization and stochastic scheduling. Math. Oper. Res. 18 658-684.
3. Chou, C., M. Queyranne, D. Simchi-Levi. 2001. The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates. Proc. 8th Internat. IPCO Conf., Utrecht, The Netherlands, 45-59.
4. Goemans, M. X. 1996. A supermodular relaxation for scheduling with release dates. Proc. 5th Integer Programming and Combinatorial Optimization Conf. Lecture Notes in Computer Science, Vol. 1084. Springer, Berlin, Germany, 288-300.
5. Goemans, M. X. 1997. Improved approximation algorithms for scheduling with release dates. Proc. 8th ACM-SIAM Sympos. on Discrete Algorithms. New York/Philadelphia, 591-598.
6. Goemans, M. X., M. Queyranne, A. S. Schulz, M. Skutella, Y. Wang. 2002. Single machine scheduling with release dates. SIAM J. Discrete Math. 15 165-192.
7. Graham, R. L., 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.
8. Iravani, S. M. R., C. P. Teo. 2005. Asymptotically optimal schedules for single-server flowshop problems with setup costs and times. Oper. Res. Lett. 33 421-430.
9. Kaminsky, P., D. Simchi-Levi. 1998. Probabilistic analysis and practical algorithms for the flow shop weighted completion time problem. Oper. Res. 46 872-882.
10. Kaminsky, P., D. Simchi-Levi. 2001a. Probabilistic analysis of an on-line algorithm for the single machine mean completion time problem with release dates. Oper. Res. Lett. 21 141-148.
11. Kaminsky, P., D. Simchi-Levi. 2001b. The asymptotic optimality of the shortest processing time rule for the flow shop completion time problem. Oper. Res. 49 293-304.
12. Lenstra, J. K., A. H. G. Rinnooy Kan, P. Brucker. 1977. Complexity of machine scheduling problems. Ann. Discrete Math. 1 343-362.
13. Möhring, R. H., A. S. Schulz, M. Uetz. 1999. Approximation in stochastic scheduling: The power of LP-based priority policies. J. ACM 46(6) 924-942.
14. Morton, T., D. Pentico. 1993. Heuristic Scheduling Systems. Wiley-Interscience, New York.
15. Pinedo, M. 1995. Scheduling: Theory, Algorithms and Systems. Prentice Hall, Englewood Cliffs, NJ.
16. Rothkopf, M. H. 1966. Scheduling with random service times. Management Sci. 12 703-713.
17. Schmidt, J. P., A. Siegel, A. Srinivasan. 1995. Chernoff-Hoeffding bounds for applications with limited independence. SIAM J. Discrete Math. 8 223-250.
18. Xia, C. H., J. G. Shanthikumar, P. W. Glynn. 2000. On the asymptotic optimality of the SPT rule for the flow shop average completion time problem. Oper. Res. 48(4) 615-622.