References
- Y. Azar, I.R. Cohen, D. Panigrahi, Randomized algorithms for online vector load balancing, New Orleans, Louisiana Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018, pp. 980–991.
- N. Bansal, T. Oosterwijk, T. Vredeveld, and R. van der Zwaan, Approximating vector scheduling: almost matching upper and lower bounds, Algorithmica 76(4) (2016), pp. 1077–1096. doi: 10.1007/s00453-016-0116-0
- Y. Bartal, S. Leonardi, A.M. Spaccamela, J. Sgall, and L. Stougie, Multiprocessor scheduling with rejection, SIAM J. Discrete Math. 13(1) (2000), pp. 64–78. doi: 10.1137/S0895480196300522
- C. Chekuri and S. Khanna, On multidimensional packing problems, SIAM J. Comput. 33(4) (2004), pp. 837–851. doi: 10.1137/S0097539799356265
- R.L. Graham, Bounds for certain multiprocessing anomalies, Bell Labs Tech. J. 45(9) (1966), pp. 1563–1581. doi: 10.1002/j.1538-7305.1966.tb01709.x
- R.L. Graham, Bounds on multiprocessing timing anomalies, SIAM J. Appl. Math. 17(2) (1969), pp. 416–429. doi: 10.1137/0117039
- S. Im, N. Kell, J. Kulkarni, and D. Panigrahi, Tight bounds for online vector scheduling, Proceedings of IEEE 56th Annual Symposium on Foundations of Computer Science, 2015, pp. 525–544.
- W. Li and Q. Cui, Vector scheduling with rejection on a single machine, 4OR 16(1) (2018), pp. 95–104. doi: 10.1007/s10288-017-0356-0
- W. Li, J. Li, X. Zhang, and Z. Chen, Penalty cost constrained identical parallel machine scheduling problem, Theor. Comput. Sci. 607 (2015), pp. 181–192. doi: 10.1016/j.tcs.2015.10.007
- X. Liu, W. Li, and X. Zhang, Strategy-proof mechanism for provisioning and allocation virtual machines in heterogeneous clouds, IEEE Trans. Parallel Distrib. Syst. 29(7) (2017), pp. 1650–1663. doi:10.1109/TPDS.2017.2785815.
- X. Liu, X. Zhang, W. Li, and X. Zhang, Swarm optimization applied to multi-resource fair allocation in heterogeneous cloud computing systems, Computing 99(12) (2017), pp. 1231–1255. doi: 10.1007/s00607-017-0561-x
- A. Meyerson, A. Roytman, and B. Tagiku, Online multidimensional load balancing, Proceedings of Approximation, Randomization, and Combinatorial Optimization, 2013, pp. 287–302.
- J. Ou, X. Zhong, and G. Wang, An improved heuristic for parallel machine scheduling with rejection, Eur. J. Oper. Res. 241(3) (2015), pp. 653–661. doi: 10.1016/j.ejor.2014.09.028
- J. Ou and X. Zhong, Bicriteria order acceptance and scheduling with consideration of fill rate, Eur. J. Oper. Res. 262(3) (2017), pp. 904–907. doi: 10.1016/j.ejor.2017.04.036
- D. Wang, Y. Yin, and M. Liu, Bicriteria scheduling problems involving job rejection, controllable processing times and rate-modifying activity, Int. J. Prod. Res. 54(12) (2016), pp. 3691–3705. doi: 10.1080/00207543.2015.1136081
- Y. Yin, T.C.E. Cheng, D. Wang, and C.-C. Wu, Improved algorithms for single-machine serial-batch scheduling with rejection to minimize total completion time and total rejection cost, IEEE Trans. Syst. Man Cybern. Syst. 46(11) (2016), pp. 1578–1588. doi: 10.1109/TSMC.2015.2505644
- L. Zhang and L. Lu, Parallel-machine scheduling with release dates and rejection, 4OR 14(2) (2016), pp. 165–172. doi: 10.1007/s10288-016-0304-4
- X. Zhong and J. Ou, Improved approximation algorithms for parallel machine scheduling with release dates and job rejection, 4OR 15(5) (2017), pp. 387–406. doi: 10.1007/s10288-016-0339-6
- X. Zhu, Q. Li, W. Mao, and G. Chen, Online vector scheduling and generalized load balancing, J. Parallel Distrib. Comput. 74(4) (2014), pp. 2304–2309. doi: 10.1016/j.jpdc.2013.12.006