, Volume 204, Issue 1, pp 189-222
Date: 09 Jan 2013

Makespan minimization in online scheduling with machine eligibility

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

In this paper we provide a survey of online scheduling in parallel machine environments with machine eligibility constraints and the makespan as objective function. We first give a brief overview of the different parallel machine environments and then survey the various types of machine eligibility constraints, including tree-hierarchical processing sets, Grade of Service processing sets, interval processing sets, and nested processing sets. We furthermore describe the relationships between the various different types of processing sets. We proceed with describing two basic online scheduling paradigms, namely online over list and online over time. For each one of the two paradigms we survey all the results that have been recorded in the literature with regard to each type of machine eligibility constraints. We obtain also several extensions in various directions. In the concluding section we describe the most important open problems in this particular area.

This is an updated version of the paper that appeared in 4OR, 8(4), 331–364 (2010).
Work of J.Y.-T.L. is supported in part by the NSF Grant CMMI-0969830.
Work of M.L.P. is supported in part by the NSF Grant CMMI-0969755.