More on ordered open end bin packing

János Balogh (), Leah Epstein () and Asaf Levin ()
Additional contact information
János Balogh: University of Szeged
Leah Epstein: University of Haifa
Asaf Levin: The Technion

Journal of Scheduling, 2021, vol. 24, issue 6, No 3, 589-614

Abstract: Abstract We consider the Ordered Open End Bin Packing problem. Items of sizes in (0, 1] are presented one by one, to be assigned to bins in this order. An item can be assigned to any bin for which the current total size is strictly below 1. This means also that the bin can be overloaded by its last packed item. We improve lower and upper bounds on the asymptotic competitive ratio in the online case. Specifically, we design the first algorithm whose asymptotic competitive ratio is strictly below 2, and its value is close to the lower bound. This is in contrast to the best possible absolute competitive ratio, which is equal to 2. We also study the offline problem where the sequence of items is known in advance, while items are still assigned to bins based on their order in the sequence. For this scenario, we design an asymptotic polynomial time approximation scheme.

Keywords: Bin packing; Online algorithms; Approximation scheme (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10951-021-00709-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:24:y:2021:i:6:d:10.1007_s10951-021-00709-3

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-021-00709-3

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().