Abstract
Disjunctive problems are scheduling problems where all resources are machines (hence activities on the same machine cannot overlap in time, i.e., they are in disjunction). These problems have been widely studied in the literature. In this chapter we address three problems: (1) the Job-Shop Problem where operations of jobs have to be processed in a given order by some specified machines, (2) the Open-Shop Problem where operations of the same job cannot overlap in time but can be executed in any order and (3) the Preemptive Job-Shop Problem.
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). Resolution of Disjunctive 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_6
Download citation
DOI: https://doi.org/10.1007/978-1-4615-1479-4_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5574-8
Online ISBN: 978-1-4615-1479-4
eBook Packages: Springer Book Archive