Abstract
This chapter deals in which order (sequence) a finite number of jobs should be processed on finite number of machines so that the elapsed time (total time involved in completion of all jobs) is minimized.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kasana, H.S., Kumar, K.D. (2004). Sequencing Problems. In: Introductory Operations Research. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-08011-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-662-08011-5_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07270-3
Online ISBN: 978-3-662-08011-5
eBook Packages: Springer Book Archive