Abstract
In this chapter we will discuss some wellknown scheduling problems which turn out to be special cases of the more general resource-constrained project scheduling problem. More precisely, we will point out how to transfer the commonly known flow-shop- (FSP), job-shop- (JSP) and open-shop-problem (OSP) to a resource-constrained project scheduling problem RCPSP. Furthermore, by the reformulation of the assembly line balancing problem as a resource-constrained project problem the versatility of the model is illustrated.
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
© 1994 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Sprecher, A. (1994). Special Cases. In: Resource-Constrained Project Scheduling. Lecture Notes in Economics and Mathematical Systems, vol 409. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-48397-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-48397-4_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57834-5
Online ISBN: 978-3-642-48397-4
eBook Packages: Springer Book Archive