EEMCS
Home > Publications
Home University of Twente
Education
Research
Prospective Students
Jobs
Publications
Intranet (internal)
 
 Nederlands
 Contact
 Sitemap
 Search
 Organisation

EEMCS EPrints Service


16449 Optimal online-list batch scheduling
 Home Policy Brochure Browse Search User Area Contact Help

Paulus, J.J. and Ye, Deshi and Zhang, Guochuan (2009) Optimal online-list batch scheduling. Information Processing Letters, 109 (19). pp. 1125-1128. ISSN 0020-0190 *** ISI Impact 0,764 ***

This is the latest version of this eprint.

Full text available as:

PDF
 - Univ. of Twente only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
139 Kb

Official URL: http://dx.doi.org/10.1016/j.ipl.2009.07.006

Exported to Metis

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.

Item Type:Article
Research Group:EWI-DMMP: Discrete Mathematics and Mathematical Programming
Research Program:CTIT-IE&ICT: Industrial Engineering and ICT
Research Project:BRICKS/IS3: Decision Support Systems for Logistic Networks and Supply Chain Optimization
ID Code:16449
Status:Published
Deposited On:03 November 2009
Refereed:Yes
International:Yes
ISI Impact Factor:0,764
More Information:statisticsmetis

Available Versions of this Item

Export this item as:

To request a copy of the PDF please email us request copy

To correct this item please ask your editor

Repository Staff Only: edit this item