A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags
- 1 January 2003
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 144 (2), 348-365
- https://doi.org/10.1016/s0377-2217(02)00136-4
Abstract
No abstract availableFunding Information
- Deutsche Forschungsgemeinschaft (Ne 137/4)
This publication has 11 references indexed in Scilit:
- Active and stable project schedulingMathematical Methods of Operations Research, 2000
- A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence ConstraintsManagement Science, 2000
- The multi-mode resource-constrained project scheduling problem with generalized precedence relationsEuropean Journal of Operational Research, 1999
- Resource-constrained project scheduling: Notation, classification, models, and methodsEuropean Journal of Operational Research, 1999
- Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithmEuropean Journal of Operational Research, 1998
- A branch and bound algorithm for the resource-constrained project scheduling problemEuropean Journal of Operational Research, 1998
- DSS for multiobjective project schedulingEuropean Journal of Operational Research, 1994
- A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling ProblemManagement Science, 1992
- An Algorithm for Solving the Job-Shop ProblemManagement Science, 1989
- Scheduling project networks with resource constraints and time windowsAnnals of Operations Research, 1988