Online bin packing with delay and holding costs (2013)
AUTHORS:
Ahlroth Lauri
,
Schumacher André
,
Orponen Pekka
JOURNAL:
Operations Research Letters
VOLUME:
41
PAGES:
1--6
@article{ AhSO13, author = "Ahlroth, Lauri and Schumacher, André and Orponen, Pekka", note = "", doi = "10.1016/j.orl.2012.10.006", responsibleauthor = "Ahlroth, Lauri and Schumacher, André and Orponen, Pekka", language = "eng", title = "Online bin packing with delay and holding costs", journal = "Operations Research Letters", issn = "0167-6377", number = "1", abstract = "We consider online bin packing where in addition to the \emph{opening cost} of each bin, the arriving items collect \emph{delay costs} until their assigned bins are released (closed), and the open bins themselves collect \emph{holding costs}. Besides being of practical interest, this problem generalises several previously unrelated online optimisation problems. We provide a general online algorithm for this problem with competitive ratio 7, with improvements for the special cases of zero delay or holding costs and size-proportional item delay costs.", month = "January", volume = "41", unitcode = "T306-99, T312-1", juforank = "2", il = "no", year = "2013", keywords = "competitive analysis, online algorithm, bin packing, rent-to-buy", flags = "copy public HIIT", kay = "NA", impactfactor = "A1", pages = "1--6" }