Abstract
This chapter deals with the sroject scheduling problem when setup times are explicitly considered (PSPST). The motivation of the problem and a mixed-integer programming formulation have been given in Section 2.5. In this chapter, it is shown how the methods derived for the single-mode project scheduling problem without setup times (cf. Chapter 5) can be properly adapted, in order to solve the more general PSPST. The remainder of the chapter is organised as follows: First, with the work of Kaplan (1991) the related literature is reviewed. Then, Section 8.1 introduces the solution procedure for the PSPST. Finally, Section 8.2 provides — on the basis of a small computational study — insight into the performance of the proposed algorithm.
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
© 1995 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kolisch, R. (1995). Project Scheduling with Setup Times. In: Project Scheduling under Resource Constraints. Production and Logistics. Physica, Heidelberg. https://doi.org/10.1007/978-3-642-50296-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-50296-5_8
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-0829-2
Online ISBN: 978-3-642-50296-5
eBook Packages: Springer Book Archive