Abstract
[Hoogeveen, 1992b] studies the general problem of the minimisation of K functions of the completion times, denoted by f imax and assumed to be increasing. We have \( f_{\max }^i\left( S \right) = \mathop {\max }\limits_{j = 1, \ldots ,n} f_j^i\left( {{C_j}\left( S \right)} \right) \) with f ij being also increasing functions. Hoogeveen proposes an a posteriori algorithm for the \( 1|| \in \left( {f_{\max }^1/f_{\max }^2, \ldots ,f_{\max }^K} \right) \) problem and distinguishes both bicriteria and mul-ticriteria cases.
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). Single machine problems. In: Multicriteria Scheduling. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04986-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-662-04986-0_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-04988-4
Online ISBN: 978-3-662-04986-0
eBook Packages: Springer Book Archive