Optimal online-list batch scheduling

J.J. Paulus, Deshi Ye, Guochuan Zhang

Research output: Contribution to journalArticleAcademicpeer-review

4 Citations (Scopus)

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 languageUndefined
Article number10.1016/j.ipl.2009.07.006
Pages (from-to)1125-1128
Number of pages4
JournalInformation processing letters
Volume109
Issue number19
DOIs
Publication statusPublished - 15 Sep 2009

Keywords

  • EWI-16449
  • IR-68276
  • METIS-264119

Cite this

Paulus, J. J., Ye, D., & Zhang, G. (2009). Optimal online-list batch scheduling. Information processing letters, 109(19), 1125-1128. [10.1016/j.ipl.2009.07.006]. https://doi.org/10.1016/j.ipl.2009.07.006