Abstract
In this chapter, we discuss the problem of scheduling jobs on parallel machines. Problem P || Σ C i and, more generally problem Q || Σ C i, are the only nonpreemptive problems with arbitrary processing times to be known polynomially solvable. Problem P2 || C max is already NP-hard. For these reasons, we discuss only problems in which preemption is possible or in which all jobs have unit processing times. In the first section of this chapter, problems with independent jobs are discussed. In the second section, we permit precedence relations between jobs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Brucker, P. (1995). Parallel Machines. In: Scheduling Algorithms. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03088-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-03088-2_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-03090-5
Online ISBN: 978-3-662-03088-2
eBook Packages: Springer Book Archive