Publisher
Springer Berlin Heidelberg
Reference53 articles.
1. 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. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, New York City, NY, pp. 32–43 (1999)
2. van den Akker, J.M.: LP–Based Solution Methods for Single–Machine Scheduling Problems. PhD thesis, Eindhoven University of Technology, Eindhoven, The Netherlands (1994)
3. Anderson, E.J., Potts, C.N.: On-line scheduling of a single machine to minimize total weighted completion time. Mathematics of Operations Research 29, 686–697 (2004)
4. Baker, K.R.: Introduction to Sequencing and Scheduling. John Wiley & Sons, New York (1974)
5. Cavalcante, C.C.B., de Souza, C.C., Savelsbergh, M.W.P., Wang, Y., Wolsey, L.A.: Scheduling projects with labor constraints. Discrete Applied Mathematics 112, 27–52 (2001)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献