Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time

References

• Afrati F., Bampis E., Chekuri C., Karger D., Kenyon C., Khanna S., Milis I., Queyranne M., Skutella M., Stein C., Sviridenko M. Approximation schemes for minimizing average weighted completion time with release dates. Proc. of the 40th Annual IEEE Sympos. on Foundations of Computer Sci. (1999) Crossref, Google Scholar
• Belouadah H., Posner M. E., Potts C. N. Scheduling with release dates on a single machine to minimize total weighted completion time. Discrete Appl. Math. (1992) 36:213–231Crossref, Google Scholar
• Goemans M. X., Queyranne M., Schulz A. S., Skutella M., Wang Y. Single machine scheduling with release dates. SIAM J. Discrete Math. (2002) 15:165–192Crossref, Google Scholar
• Hall L. A., Schulz A. S., Shmoys D. B., Wein J. Scheduling to minimize average completion time: Offline and online algorithms. Math. Oper. Res. (1997) 22:513–544Link, Google Scholar
• Hoogeveen J. A., Vestjens A. P. A., Cunningham W. H., McCormick S. T., Queyranne M. Optimal online algorithms for single-machine scheduling. Integer Programming and Combinatorial Optimization. Proc. of the Fifth Internat. IPCO Conf. (1996) (Springer, Berlin, Germany) 404–414Lecture Notes in Computer Science, No. 1084Crossref, Google Scholar
• Labetoulle J., Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G., Pulleyblank W. R. Preemptive scheduling of uniform machines subject to release dates. Progress in Combinatorial Optimization (1984) (Academic Press, New York) 245–261Crossref, Google Scholar
• Lenstra J. K., Rinnooy Kan A. H. G., Brucker P. Complexity of machine scheduling problems. Ann. Oper. Res. (1977) 1:343–362Google Scholar
• Phillips C., Stein C., Wein J. Minimizing average completion time in the presence of release dates. Math. Programming (1998) 82:199–223Crossref, Google Scholar
• Smith W. E. Various optimizers for single-stage production. Naval Res. Logist. Quart. (1956) 3:59–66Crossref, Google Scholar
• Uma R. N., Wein J., Bixby R. E., Boyd E. A., Ríos-Mercado R. Z. On the relationship between combinatorial and LP-based approaches to NP-hard scheduling problems. Integer Programming and Combinatorial Optimization. Proc. of the Sixth Internat. IPCO Conf. (1998) (Springer, Berlin, Germany) 394–408Lecture Notes in Computer Science, No. 1412Crossref, Google Scholar