Strip packing with precedence constraints and strip packing with release times

Theoretical Computer Science

Volumn 410, Issue 38-40, 2009, Pages 3792-3803

  Augustine, John ^a   Banerjee, Sudarshan ^b   Irani, Sandy ^c  

^a TATA RESEARCH DEVELOPMENT AND DESIGN CENTRE   (India)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c 5226 Donald Bren Hall   (United States)

Author keywords

Approximation algorithms; Field programmable gate array; Linear programming; Precedence constraints; Strip packing

Indexed keywords

ARBITRARY HEIGHT; COMPUTING RESOURCE; FIELD-PROGRAMMABLE GATE ARRAY; FIXED POSITIVE INTEGERS; FIXED WIDTH; FPGA APPLICATIONS; LINEAR ARRANGEMENTS; LINEAR TOPOLOGY; POLYNOMIAL TIME APPROXIMATION SCHEMES; PRECEDENCE CONSTRAINTS; RE-CONFIGURABLE; RELEASE TIME; RESOURCE CONSTRAINED SCHEDULING; RUNNING TIME; SCHEDULING PROBLEM; SCHEDULING TASKS; STANDARD ASSUMPTIONS; STRIP PACKING; STRIP PACKING PROBLEM;

ASYMPTOTIC ANALYSIS; DYNAMIC PROGRAMMING; FIELD PROGRAMMABLE GATE ARRAYS (FPGA); GEOMETRY; LINEARIZATION; LOGIC GATES; OPTICAL SENSORS; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 68249093383     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.05.024     Document Type: Article

References (25)

1. Augustine J., and Seiden S. Linear time approximation schemes for vehicle scheduling problems. Theoret. Comput. Sci. 324 2-3 (2004) 147-160
2. Baker B.S., Brown D.J., and Katseff H.P. A 5/4 algorithm for two-dimensional packing. J. Algorithms 2 4 (1981) 348-368
3. Baker B.S., Coffman E.G., and Rivest R.L. Orthogonal packings in two dimensions. SIAM J. Comput. 9 4 (1980) 846-855
4. S. Banerjee, E. Bozorgzadeh, N. Dutt, Physically-aware hw-sw partitioning for reconfigurable architectures with partial dynamic reconfiguration, in: Design Automation Conference, 2005, pp. 335-340
5. Buchsbaum A.L., Karloff H., Kenyon C., Reingold N., and Thorup M. Opt versus load in dynamic storage allocation. SIAM J. Comput. 33 3 (2004) 632-646
6. Coffman E.G., Garey M.R., Johnson D.S., and Tarjan R.E. Performance bounds for level-oriented two-dimensional packing algorithms. SIAM J. Comput. 9 4 (1980) 808-826
7. Csirik J., and Woeginger G.J. Shelf algorithms for on-line strip packing. Inform. Process. Lett. 63 4 (1997) 171-175
8. de la Vega W.F., and Lueker G.S. Bin packing can be solved within 1 + ε{lunate} in linear time. Combinatorica 1 4 (1981) 349-355
9. de la Vega W.F., and Zissimopoulos V. An approximation scheme for strip packing of rectangles with bounded dimensions. Discrete Appl. Math. 82 1-3 (1998) 93-101
10. Grotschel M., Lovasz L., and Schrijver A. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1 (1981) 169-197
11. Jansen K., and van Stee R. On strip packing with rotations. Proceedings of the Thirty-seventh Annual ACM Symposium on Theory of Computing (2005), ACM Press, New York, NY, USA 755-761
12. Jansen K., and Zhang H. Scheduling malleable tasks with precedence constraints. Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (2005), ACM Press, New York, NY, USA 86-95
13. Johnson D.S., Garey M.R., Graham R.L., and Yao A.C. Resource constrained scheduling as generalized bin packing. J. Combin. Theory 21 3 (1976) 257-298
14. Karmarkar N. A new polynomial-time algorithm for linear programming. Combinatorica 4 (1984) 373-395
15. N. Karmarkar, R. Karp, An efficient approximation scheme for the one dimensional bin-packing problem, in: Proceedings of the 23rd Sympos. Foundations Computer Sci., FOCS, Tucson, AZ, 1982, pp. 312-320
16. Kenyon C., and Rémila E. A near-optimal solution to a two-dimensional cutting stock problem. Math. Oper. Res. 25 4 (2000) 645-656
17. Lepère R., Trystram D., and Woeginger G.J. Approximation algorithms for scheduling malleable tasks under precedence constraints. Proceedings of the 9th Annual European Symposium on Algorithms (2001), Springer-Verlag, London, UK 146-157
18. Martel C. Preemptive scheduling with release times, deadlines, and due times. J. Assoc. Comput. Mach. 29 3 (1982) 812-829
19. Martello S., Monaci M., and Vigo D. An exact approach to the strip-packing problem. INFORMS J. Comput. 15 3 (2003) 310-319
20. Mounie G., Rapine C., and Trystram D. Efficient approximation algorithms for scheduling malleable tasks. Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures (1999), ACM Press, New York, NY, USA 23-32
21. Queyranne M. Bounds for assembly line balancing heuristics. Oper. Res. 33 6 (1985) 1353-1359
22. Schiermeyer I. Reverse-fit: A 2-optimal algorithm for packing rectangles. Proceedings of the Second Annual European Symposium on Algorithms (1994), Springer-Verlag, London, UK 290-299
23. Steiger C., Walder H., and Platzner M. Operating systems for reconfigurable embedded platforms: Online scheduling of real-time tasks. IEEE Trans. Comput. 53 11 (2004) 1393-1407
24. Steinberg A. A strip-packing algorithm with absolute performance bound 2. SIAM J. Comput. 26 2 (1997) 401-409
25. Xilinx. http://www.xilinx.com