Approximation schemes for packing with item fragmentation

Theory of Computing Systems

Volumn 43, Issue 1, 2008, Pages 81-98

  Shachnai, Hadas ^a   Tamir, Tami ^b   Yehezkely, Omer ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b INTERDISCIPLINARY CENTER   (Israel)

Author keywords

Algorithms; Bin packing; Item fragmentation; Linear programming; Polynomial time approximation schemes

Indexed keywords

APPROXIMATION SCHEME; BIN PACKING; BIN PACKING PROBLEM; FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES; ITEM FRAGMENTATION; MESSAGE TRANSMISSIONS; POLYNOMIAL TIME APPROXIMATION SCHEMES; PRE-EMPTIVE SCHEDULING;

ALGORITHMS; BINS; LINEAR PROGRAMMING; POLYNOMIAL APPROXIMATION; VLSI CIRCUITS;

APPROXIMATION ALGORITHMS;

EID: 40849135778     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-007-9082-x     Document Type: Conference Paper

References (23)

1. Beling, P., Megiddo, N.: Using fast matrix multiplication to find basic solutions. Theor. Comput. Sci. 205, 307-316 (1998)
2. Braun, O., Schmidt, G.: Parallel processor scheduling with limited number of preemptions. SIAM J. Comput. 32(3), 671-680 (2003)
3. Brucker, P.: Scheduling Algorithms, 4th edn. Springer, Berlin (2004)
4. Coffman, E.G. Jr., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: a survey. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 46-93. PWS Publishing, Boston (1997)
5. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press/McGraw-Hill, Cambridge/New York (2002)
6. Epstein, L., Sgall, J.: Approximation schemes for scheduling on uniformly related and identical parallel machines. In: Proc. of the 7th European Symposium on Algorithms. Lecture Notes in Computer Science, vol. 1643, pp. 151-162. Springer, Berlin (1999)
7. Fernandez de la Vega, W., Lueker, G.S.: Bin packing can be solved within 1+ε in linear time. Combinatorica 1, 349-355 (1981)
8. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
9. Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: Practical and theoretical results. J. ACM 34(1), 144-162 (1987)
10. Karmarkar, N.: A new polynomial-time algorithm for linear programming. Combinatorica 4, 373-396 (1984)
11. Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one dimensional bin packing problem. In: Proc. 23rd IEEE Annual Symposium on Foundations of Computer Science, pp. 312-320, 1982
12. Leung, J.Y.-T. (ed.): Handbook of Scheduling: Algorithms, Models and Performance Analysis. Computer and Information Science Series. Chapman & Hall/CRC, Boca Raton (2004)
13. Mandal, C.A., Chakrabarti, P.P., Ghose, S.: Complexity of fragmentable object bin packing and an application. Comp. Math. Appl. 35(11), 91-97 (1998)
14. McNaughton, R.: Scheduling with deadlines and loss functions. Manag. Sci. 6, 1-12 (1959)
15. Menakerman, N., Rom, R.: Bin packing problems with item fragmentations. In: Proc. of WADS, 2001
16. Motwani, R.: Lecture notes on approximation algorithms. Technical report, Dept. of Computer Science, Stanford Univ., CA (1992)
17. Multimedia Cable Network System Ltd.: Data-over-cable service interface specification, http://www.cablelabs.com (2000)
18. Naaman, N., Rom, R.: Packet scheduling with fragmentation. In: Proc. of INFOCOM'02, pp. 824-831, 2002
19. Shachnai, H., Tamir, T., Woeginger, G.J.: Minimizing makespan and preemption costs on a system of uniform machines. Algorithmica 42, 309-334 (2005)
20. Sourd, F.: Preemptive scheduling with position costs. Algorithmic Oper. Res. AOR 1(2) (2006)
21. Spielman, D.A., Teng, S.-H.: Smoothed analysis of termination of linear programming algorithms. Math. Program. Ser. B 97, 375-404 (2003)
22. Todd, M.J.: The many facets of linear programming. Math. Program. Ser. B 91, 417-436 (2002)
23. Vazirani, V.V.: Bin packing. In: Approximation Algorithms, pp. 74-78. Springer, Berlin (2001)