Online Strip Packing with Polynomial Migration
暂无分享,去创建一个
[1] Amit Kumar,et al. Fully-Dynamic Bin Packing with Limited Repacking , 2017, ArXiv.
[2] Ronald L. Rivest,et al. Introduction to Algorithms, third edition , 2009 .
[3] Klaus Jansen,et al. A Robust AFPTAS for Online Bin Packing with Polynomial Migration, , 2013, ICALP.
[4] Richard M. Karp,et al. An efficient approximation scheme for the one-dimensional bin-packing problem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[5] József Békési,et al. New lower bounds for certain classes of bin packing algorithms , 2012, Theor. Comput. Sci..
[6] Yanling Mao,et al. A new lower bound for online strip packing , 2016, Eur. J. Oper. Res..
[7] Johann Hurink,et al. Online scheduling of parallel jobs on two machines is 2-competitive , 2008, Oper. Res. Lett..
[8] Giorgio Gambosi,et al. Algorithms for the Relaxed Online Bin-Packing Model , 2000, SIAM J. Comput..
[9] Guochuan Zhang,et al. A note on online strip packing , 2009, J. Comb. Optim..
[10] Klaus Jansen,et al. A (5/3 + ε)-approximation for strip packing , 2014, Comput. Geom..
[11] Marco Platzner,et al. Online scheduling and placement of real-time tasks to partially reconfigurable devices , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.
[12] Leah Epstein,et al. A robust APTAS for the classical bin packing problem , 2009, Math. Program..
[13] Brenda S. Baker,et al. Shelf Algorithms for Two-Dimensional Packing Problems , 1983, SIAM J. Comput..
[14] Guochuan Zhang,et al. Online multiple-strip packing , 2011, Theor. Comput. Sci..
[15] Martin Skutella,et al. Online Scheduling with Bounded Migration , 2004, ICALP.
[16] Walter Kern,et al. A note on the lower bound for online strip packing , 2009 .
[17] Johann Hurink,et al. Online Algorithm for Parallel Job Scheduling and Strip Packing , 2007, WAOA.
[18] Ronald L. Rivest,et al. Orthogonal Packings in Two Dimensions , 1980, SIAM J. Comput..
[19] Guochuan Zhang,et al. Strip Packing vs. Bin Packing , 2006, AAIM.
[20] Csanád Imreh. Online strip packing with modifiable boxes , 2001, Oper. Res. Lett..
[21] Klaus Jansen,et al. Fully Dynamic Bin Packing Revisited , 2015, APPROX-RANDOM.
[22] Berit Johannes,et al. Scheduling parallel jobs to minimize the makespan , 2006, J. Sched..
[23] Claire Mathieu,et al. A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem , 2000, Math. Oper. Res..
[24] Gerhard J. Woeginger,et al. Shelf Algorithms for On-Line Strip Packing , 1997, Inf. Process. Lett..
[25] Henrik I. Christensen,et al. Approximation and online algorithms for multidimensional bin packing: A survey , 2017, Comput. Sci. Rev..
[26] Martin Skutella,et al. Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures , 2016, Math. Oper. Res..
[27] Brenda S. Baker,et al. Lower bounds for on-line two-dimensional packing algorithms , 1982, Acta Informatica.
[28] Kurt Eisemann,et al. The Trim Problem , 1957 .
[29] Robert E. Tarjan,et al. Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms , 1980, SIAM J. Comput..
[30] Steven S. Seiden,et al. On the online bin packing problem , 2001, JACM.