No abstract

No abstract

bin packing, scheduling, algorithms, rectangles, on-line, lower bounds A B S T R A C T (C o n t in u e on re v e r se s id e if n e c e s s a r y and id e n tify by b lo c k num ber)Many problems, such as cutting stock problems and the scheduling of tasks with a shared resource, can be viewed as two-dimensional bin packing problems. Using the two-dimensional packing model of Baker, Coffman, and Rivest, a finite list L of rectangles is to be packed into a rectangular bin of finite width but infinite height, so as to minimize the total height used. An algorithm which packs the list in the order given without looking ahead or moving pieces already packed is called an on-line algorithm. Since the problem of finding an optimal packing is DD 1 J ? N M 73 1473 UNCLASSIFIED S E C U R IT Y C L A S S IF IC A T IO N O F T H IS P A G E (When D a ta E n te re d ) UNCLASSIFIED S E C U R IT Y C L A S S IF IC A T IO N O F T H IS PAGEfHTian D a ta E n te re d ) _________ (cont.)NP-hard, previous work has been directed at finding approximation algorithms. Most of the approximation algorithms which have been studied are on-line except that they require the list to have been previously sorted by height or width. This paper examines lower bounds for the worst-case performance of on-line algorithms for both non-preordered lists and for lists preordered by increasing or decreasing height or width. UNCLASSIFIED S E C U R IT Y C L A S S IF IC A T IO N O F T H IS ABSTRACTMany problems, such as cutting stock problems and the scheduling of tasks with a shared resource, can be viewed as two-dimensional bin packing problems. Using the two-dimensional packing model of Baker, Coffman, and Rivest, a finite list L of rectangles is to be packed into a rectangular bin of finite width but infinite height, so as to minimize the total height used. An algorithm which packs the list in the order given without looking ahead or moving pieces already packed is called an on-line algorithm. Since the problem of finding an optimal packing is NP-hard, previous work has been directed at finding approximation algorithms. Most of the approximation algorithms which have been studied are on-line except that they require the list to have been previously sorted by height or width. This paper examines lower bounds for the worst-case performance of on-line algorithms for both non-preordered lists and for lists preordered by increasing or decreasing height or width.

No abstract

No abstract