Author:
Gu Mengyang,Tan Zhiyi,Xia Binzhou,Yan Yujie
Publisher
Springer Science and Business Media LLC
Reference21 articles.
1. Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation schemes for scheduling on parallel machines. J. Sched. 1(1), 55–66 (1998)
2. Angel, E., Bampis, E., Fishkin, A.V.: A note on scheduling to meet two min-sum objectives. Oper. Res. Lett. 35, 69–73 (2007)
3. Aslam, J., Rasala, A., Stein, C., Young, N.: Improved bicriteria existence theorems for scheduling. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 846–847 (1999)
4. Babel, L., Kellerer, H., Kotov, V.: The $$k$$ k -partitioning problem. Math. Methods Oper. Res. 47, 59–82 (1998)
5. Bampis, E., Kononov, A.: Bicriteria approximation algorithms for scheduling problems with communications delays. J. Sched. 8, 281–294 (2005)