Abstract
In sections 4.1 to 4.4 we examine the case that the number of machines m is equal to 1.
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.
Rights and permissions
Copyright information
© 1976 Martinus Nijhoff, The Hague
About this chapter
Cite this chapter
Kan, A.H.G.R. (1976). One-machine problems. In: Machine Scheduling Problems. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-4383-7_4
Download citation
DOI: https://doi.org/10.1007/978-1-4613-4383-7_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-90-247-1848-1
Online ISBN: 978-1-4613-4383-7
eBook Packages: Springer Book Archive