EEMCS EPrints Service

Education

Research

Prospective Students

Jobs

Publications

Intranet (internal)

Nederlands

Contact

Sitemap

Organisation

14234 Optimal online-list batch scheduling

Home Policy Brochure Browse Search User Area Contact Help

Paulus, J.J. and Ye, Deshi and Zhang, Guochuan (2008) Optimal online-list batch scheduling. Beta Working Paper WP-260, Beta, Research School for Operations Management and Logistics, Eindhoven. ISSN 1386-9213

There is a more recent version of this eprint available. Click here to view it.

Full text available as:

PDF

- Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
117 Kb

Official URL: http://www.tue.nl/beta

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:	Internal Report (Beta Working Paper)
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:	14234
Deposited On:	28 November 2008
More Information:	statistics metis

Available Versions of this Item

Optimal online-list batch scheduling (deposited 28 November 2008)
[Currently Displayed]
- Optimal online-list batch scheduling (deposited 03 November 2009)

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item