Complexity of fragmentable object bin packing and an application

Computers and Mathematics with Applications

Volumn 35, Issue 11, 1998, Pages 91-97

  Mandal, C A ^a   Chakrabarti, P P ^b   Ghose, S ^b  

^a BRUNEL UNIVERSITY   (United Kingdom)

^b INDIAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

Bin packing; Complexity of algorithms; High level synthesis; Scheduling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATA TRANSFER; PROBLEM SOLVING; SCHEDULING; SET THEORY;

DATA PATH SYNTHESIS; FRAGMENTABLE OBJECT BIN PACKING PROBLEM;

COMPUTATIONAL COMPLEXITY;

EID: 0032093343     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0898-1221(98)00087-X     Document Type: Article

References (9)

1. M. Garey and D. Johnson, A Guide to the Theory of NP-Completeness, Freeman, San Fransisco, CA, (1979).
2. R.E. Miller and J.W. Thatcher, Editors, Reducibility Among Combinatorial Problems, Volume 5, pp. 85-103, Plenum Press, (1972).
3. E.G. Coffman, Jr, Editors, Computer and Job Shop Scheduling Theory, John Wiley & Sons, (1976).
4. B. Berger and L. Cowen, Complexity results and algorithms for {<, ≤, =}-constrained scheduling, In Proceedings of 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, C.A., pp. 137-147, (1991).
5. C.A. Mandal, P.P. Chakrabarti and S. Ghose, Complexity of scheduling in high level synthesis, VLSI Design (to appear).
6. A.V. Aho, R. Sethi and J.D. Ullman, COMPILERS Principles, Techniques and Tools, Addison-Wesley, (June 1987).
7. C. Mandal and R.M. Zimmer, High-level synthesis of structured data paths, In IFIP TC10 WG 10.5 International Conference on Computer Hardware Description Languages and their Applications, pp. 92-94, April 20-25.
8. J.H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI, (1975).
9. L. Davis, Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, (1991).