-
Notifications
You must be signed in to change notification settings - Fork 0
/
info.json
17 lines (17 loc) · 1.16 KB
/
info.json
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
{
"abstract": "We consider a sequential version of the classical bin packing problem\nin which items are received one by one. Before the size of the next\nitem is revealed, the decision maker needs to decide whether\nthe next item is packed in the currently open bin or the bin is\nclosed and a new bin is opened. If the new item does not fit, it is\nlost. If a bin is closed, the remaining free space in the bin accounts\nfor a loss. The goal of the decision maker is to minimize the\nloss accumulated over <i>n</i> periods. We present\nan algorithm that has a cumulative loss not much larger than any\nstrategy in a finite class of reference strategies\nfor any sequence of items.\nSpecial attention is payed to reference strategies\nthat use a fixed threshold at each step to decide whether a new bin\nis opened. Some positive and negative results are presented for this case.",
"authors": [
"Andr{{\\'a}}s Gy{{\\\"o}}rgy",
"G{{\\'a}}bor Lugosi",
"Gy{{\\\"o}}rgy Ottucsàk"
],
"id": "gyorgy10a",
"issue": 4,
"pages": [
89,
109
],
"title": "On-Line Sequential Bin Packing",
"volume": "11",
"year": "2010"
}