Abstract
[Mohri et al., 1999] are interested in a bicriteria scheduling problem where two machines are available to process n independent jobs that can be preempted at any (real) time. Each job J¿ is defined by a processing time p i and a due date di. Without loss of generality we assume that d 1 ≤ d 2 ≤ ... ≤ d n . The aim is to schedule the jobs in such a way that the makespan C max sind the maximum lateness L max are minimised. By considering the e constraint approach they provide a characterisation of strictly non dominated criteria vectors. This problem is solvable in polynomial time.
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
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
T’kindt, V., Billaut, JC. (2002). Parallel machines problems. In: Multicriteria Scheduling. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04986-0_9
Download citation
DOI: https://doi.org/10.1007/978-3-662-04986-0_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-04988-4
Online ISBN: 978-3-662-04986-0
eBook Packages: Springer Book Archive