Abstract
We illustrate and compare the efficiency of the constraint propagation algorithms described in previous chapters on two well-known scheduling problems. In Section 8.1 we study the problem of minimizing the weighted number of late jobs on m parallel identical machines and in Section 8.2 we consider a general-shop scheduling problem with sequence-dependent setup times and alternative machines where the optimization criteria are both makespan and sum of setup times.
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
© 2001 Springer Science+Business Media New York
About this chapter
Cite this chapter
Baptiste, P., Le Pape, C., Nuijten, W. (2001). Min-Sum Scheduling Problems. In: Constraint-Based Scheduling. International Series in Operations Research & Management Science, vol 39. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1479-4_8
Download citation
DOI: https://doi.org/10.1007/978-1-4615-1479-4_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5574-8
Online ISBN: 978-1-4615-1479-4
eBook Packages: Springer Book Archive