Abstract
Many industrial scheduling problems are variants, extensions or restrictions of the “Resource-Constrained Project Scheduling Problem”. Given (i) a set of resources with given capacities, (ii) a set of non-interruptible activities of given processing times, (iii) a network of precedence constraints between the activities, and (iv) for each activity and each resource the amount of the resource required by the activity over its execution, the goal of the RCPSP is to find a schedule meeting all the constraints whose makespan (i.e., the time at which all activities are finished) is minimal. The decision variant of the RCPSP, i.e., the problem of determining whether there exists a schedule of makespan smaller than a given deadline, is NP-hard in the strong sense [77].
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
© 2001 Springer Science+Business Media New York
About this chapter
Cite this chapter
Baptiste, P., Le Pape, C., Nuijten, W. (2001). Cumulative Scheduling 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_7
Download citation
DOI: https://doi.org/10.1007/978-1-4615-1479-4_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5574-8
Online ISBN: 978-1-4615-1479-4
eBook Packages: Springer Book Archive