Abstract
This chapter addresses project scheduling with generalised precedence constraints and multiple execution modes per activity, reflecting time-resource and resource-resource tradeoffs. It shows how the branch-and-bound algorithm developed for the single-mode problem PSI |temp| C max in the previous chapter can be extended for the multi-mode problem MPS |temp| C max .
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
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Dorndorf, U. (2002). Multi-Mode Extension of the Branch-and-Bound Algorithm. In: Project Scheduling with Time Windows. Contributions to Management Science. Physica, Heidelberg. https://doi.org/10.1007/978-3-642-57506-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-57506-8_6
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-1516-0
Online ISBN: 978-3-642-57506-8
eBook Packages: Springer Book Archive