Optimal online-list batch scheduling

J.J. Paulus; Deshi Ye; Guochuan Zhang

doi:10.1016/j.ipl.2009.07.006

Optimal online-list batch scheduling

J.J. Paulus, Deshi Ye, Guochuan Zhang

Discrete Mathematics and Mathematical Programming

Research output: Contribution to journal › Article › Academic › peer-review

4 Citations (Scopus)

7 Downloads (Pure)

Abstract

We consider the online-list batch scheduling problem. Jobs arrive one by one and have to be assigned upon arrival to a scheduled batch such that the makespan is minimized. Each batch can accommodate up to B jobs. We give a complete classification of the tractability of this online problem.

Original language	Undefined
Article number	10.1016/j.ipl.2009.07.006
Pages (from-to)	1125-1128
Number of pages	4
Journal	Information processing letters
Volume	109
Issue number	19
DOIs	https://doi.org/10.1016/j.ipl.2009.07.006
Publication status	Published - 15 Sept 2009

Keywords

EWI-16449
IR-68276
METIS-264119

Access to Document

10.1016/j.ipl.2009.07.006

http://eprints.eemcs.utwente.nl/secure2/16449/01/sdarticle.pdf

Cite this

@article{7971cd7a4dde44c093c13562f576e645,

title = "Optimal online-list batch scheduling",

abstract = "We consider the online-list batch scheduling problem. Jobs arrive one by one and have to be assigned upon arrival to a scheduled batch such that the makespan is minimized. Each batch can accommodate up to B jobs. We give a complete classification of the tractability of this online problem.",

keywords = "EWI-16449, IR-68276, METIS-264119",

author = "J.J. Paulus and Deshi Ye and Guochuan Zhang",

note = "10.1016/j.ipl.2009.07.006 ",

year = "2009",

month = sep,

day = "15",

doi = "10.1016/j.ipl.2009.07.006",

language = "Undefined",

volume = "109",

pages = "1125--1128",

journal = "Information processing letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "19",

}

TY - JOUR

T1 - Optimal online-list batch scheduling

AU - Paulus, J.J.

AU - Ye, Deshi

AU - Zhang, Guochuan

N1 - 10.1016/j.ipl.2009.07.006

PY - 2009/9/15

Y1 - 2009/9/15

N2 - We consider the online-list batch scheduling problem. Jobs arrive one by one and have to be assigned upon arrival to a scheduled batch such that the makespan is minimized. Each batch can accommodate up to B jobs. We give a complete classification of the tractability of this online problem.

AB - We consider the online-list batch scheduling problem. Jobs arrive one by one and have to be assigned upon arrival to a scheduled batch such that the makespan is minimized. Each batch can accommodate up to B jobs. We give a complete classification of the tractability of this online problem.

KW - EWI-16449

KW - IR-68276

KW - METIS-264119

U2 - 10.1016/j.ipl.2009.07.006

DO - 10.1016/j.ipl.2009.07.006

M3 - Article

SN - 0020-0190

VL - 109

SP - 1125

EP - 1128

JO - Information processing letters

JF - Information processing letters

IS - 19

M1 - 10.1016/j.ipl.2009.07.006

ER -