On-line bin packing with arbitrary release times

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4614 LNCS, Issue , 2007, Pages 340-349

  Shi, Yongqiang ^a   Ye, Deshi ^b  

^a ZHEJIANG UNIVERSITY   (China)

^b ZHEJIANG UNIVERSITY   (China)

Author keywords

Arbitrary release time; Bin packing; On line algorithm

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; PROBLEM SOLVING;

ARBITRARY RELEASE TIME; BIN PACKING;

ONLINE SYSTEMS;

EID: 38049078856     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74450-4_31     Document Type: Conference Paper

References (11)

1. Augustine, J., Banerjee, S., Irani, S.: Strip Packing with Precedence Constraints and Strip Packing with Release Times. In: Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures, pp. 180-188 (2006)
2. Cieliebak, M., Erlebach, T., Hennecke, F., Weber, B., Widmayer, P.: Scheduling with Release Times and Deadlines on a Minimum Number of Machines. IFIP TCS, 209-222 (2004)
3. Coffman Jr., E.G., Galambos, G., Martello, S., Vigo, D.: Bin packing approximation algorithms: Combinatorial analysis. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, Kluwer Academic Publishers, Dordrecht (1998)
4. Coffman Jr., E.G., Garey, M.R., Johnson, D.S.: Bin packing approximation algorithms: A survey. In: Hochbaum, D.S. (ed.) Approximation algorithm for NP-hard problems, pp. 46-93. PWS (1996)
5. Csirik, J., Woeginger, G.J.: On-line packing and covering problems. In: Goto, E., Nakajima, R., Yonezawa, A., Nakata, I., Furukawa, K. (eds.) RIMS Symposium on Software Science and Engineering. LNCS, vol. 147, pp. 147-177. Springer, Heidelberg (1983)
6. Garey, M.R., Johnson, D.S.: Computers and Intractability (A guide to the theory of NP-completeness.). W. H. Freeman and Company, San Francisco (1979)
7. Johnson, D.S., Demers, A., Ullman, J.D., Garey, M.R., Graham, R.L.: Worst-case performance bounds for simple one-dimensional packing algorithms. Siam Journal on Computing 3, 256-278 (1974)
8. Li, R., Huang, H.-C.: On-line Scheduling for Jobs with Arbitrary Release Times. Computing 73, 79-97 (2004)
9. Seiden, S.: On the online bin packing problem. Journal of the ACM 49, 640-671 (2002)
10. Ullman, J.D.: The performance of a memory allocation algorithm. Technial Report 100, Princeton University, Princeton, NJ (1971)
11. van Vliet, A.: An improved lower bound for on-line bin packing algorithms. Information processing letters 42, 277-284 (1992)