Abstract
Publisher Summary This chapter discusses different types of sequencing and scheduling problems, and describes different types of algorithms and the concepts of complexity theory. A class of deterministic machine scheduling problems has been introduced in the chapter. The chapter also deals with the single machine, parallel machine and multi-operation problems in this class, respectively. The two generalizations of the deterministic machine-scheduling model have been presented in the chapter. A deterministic scheduling model may give rise to various stochastic counterparts, as there is a choice in the parameters that are randomized, in their distributions, and in the classes of policies that can be applied. A characteristic feature of these models is that the stochastic parameters are regarded as independent random variables with a given distribution and that their realization occurs only after the scheduling decision has been made. In the deterministic model, one has perfect information, and capitalizing on it in minimizing the realization of a performance measure may require exponential time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Handbooks in Operations Research and Management Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
