Abstract
We have shown in Section 7.4 that the operations scheduling problem (7.1) – (7.9) is NP-hard. Hence, optimal algorithms are not applicable for industrial applications, where hundreds to thousands of operations have to be scheduled within minutes of CPU-time. We will therefore consider two types of heuristics: construction heuristics in Section 10.1 (cf. Kolisch [188]) and improvement heuristics in Section 10.2 (cf. Kolisch and Heß [190]).
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-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kolisch, R. (2001). Operations Scheduling Methods. In: Make-to-Order Assembly Management. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04514-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-662-04514-5_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07431-8
Online ISBN: 978-3-662-04514-5
eBook Packages: Springer Book Archive