Optimal online-list batch scheduling

J.J. Paulus, Deshi Ye, Guochuan Zhang

Research output: Book/ReportReportProfessional

280 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 languageUndefined
Place of PublicationEindhoven
PublisherUniversity of Twente
Number of pages10
ISBN (Print)9789038614885
Publication statusPublished - Nov 2008

Publication series

NameBeta working papers
PublisherBeta, Research School for Operations Management and Logistics
No.WoTUG-31/260
ISSN (Print)1386-9213

Keywords

  • On-line algorithms
  • Competitive Analysis
  • IR-65146
  • Batch Scheduling
  • METIS-254920
  • EWI-14234

Cite this