Abstract
In this section we are interested in multicriteria flowshop scheduling problems with two machines. Each job J i is processed on the machine M1 for a duration p i ,1 then on the machine M 2 for a duration p i,2- In this context, the multicriteria scheduling problem which is addressed the most in the literature involves the minimisation of the criteria math and C max . Different scheduling problems are derived according to the form of the considered objective function.
This is a preview of subscription content, log in via an institution to check access.
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). Shop problems. In: Multicriteria Scheduling. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04986-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-662-04986-0_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-04988-4
Online ISBN: 978-3-662-04986-0
eBook Packages: Springer Book Archive