Author:
Li Jianshu,Hu Xiaoyin,Luo Junjie,Cui Jinchuan
Publisher
Springer International Publishing
Reference18 articles.
1. Albers, S., Baruah, S.K., Möhring, R.H., Pruhs, K.: Open problems - scheduling. In: Scheduling. No. 10071 in Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, Dagstuhl, Germany (2010)
2. Bagga, P.C., Karlra, K.R.: A node elimination procedure for townsend’s algorithm for solving the single machine quadratic penalty function scheduling problem. Manage. Sci. 26(6), 633–636 (1980).
https://doi.org/10.1287/mnsc.26.6.633
3. Bansal, N., Pruhs, K.: The geometry of scheduling. SIAM J. Comput. 43(5), 1684–1698 (2014).
https://doi.org/10.1137/130911317
4. Bansal, N., Dürr, C., Thang, N.K., Vásquez, O.C.: The local-global conjecture for scheduling with non-linear cost. J. Sched. 20(3), 239–254 (2017).
https://doi.org/10.1007/s10951-015-0466-5
5. Cheung, M., Mestre, J., Shmoys, D., Verschae, J.: A primal-dual approximation algorithm for min-sum single-machine scheduling problems. SIAM J. Discrete Math. 31(2), 825–838 (2017).
https://doi.org/10.1137/16M1086819