Models for video-on-demand scheduling with costs

Ahlroth, 2013, Online bin packing with delay and holding costs, Oper Res Lett, 41, 1, 10.1016/j.orl.2012.10.006 Air Canada Altitude Privileges (2014). https://altitude.aircanada.com/status/program-privileges. Accessed 14 June 2014 Azar Y, Ben-Aroya N, Devanur NR, Jain N (2013) Cloud scheduling with setup cost, SPAA Babel, 2004, Algorithms for online bin-packing problems with cardinality constraints, Discrete Appl Math, 143, 238, 10.1016/j.dam.2003.05.006 Bein D, Bein W, Venigella S (2015) Cloud storage and online bin packing. In: Brazier FMT et al (eds) Intelligent distributed computing V, SCI, vol 382. Springer, Berlin, pp 63–68 Coffman, 1983, Dynamic bin packing, SIAM J Comput, 12, 227, 10.1137/0212014 Esptein, 2006, Online bin packing with cardinality constraints, SIAM J Discrete Math, 20, 1015, 10.1137/050639065 Galambos, 1991, A 1.6 lower-bound for the two-dimensional on-line rectangle bin-packing, Acta Cybern, 10, 21 Han X, Chin FYL, Ting H-F, Zhang G, Zhang Y (2011) A new upper bound 2.5545 on 2D online bin packing. ACM Trans Alg 7, article number 50 Kamali S, Lopez-Ortiz A (2014) An all-around near-optimal solution for the classic bin packing problem. arXiv:1404.4526 Krause, 1975, Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems, J ACM, 22, 522, 10.1145/321906.321917 Krause, 1977, Errata: Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems, J ACM, 24, 527, 10.1145/322017.322032 Lee, 1985, A simple on-line bin-packing algorithm, J ACM, 32, 562, 10.1145/3828.3833 Seiden, 2003, New bounds for multidimensional packing, Algorithmica, 36, 261, 10.1007/s00453-003-1016-7