The discrete time/resource trade-off problem in project networks: A branch-and-bound approach
In many solution methods for resource-constrained project scheduling, it is assumed that both the duration of each activity and its resource requirements are known and fixed. In real-life projects, however, it often occurs that only one renewable bottleneck resource is available and that the activit...
Saved in:
Main Authors: | DEMEULEMEESTER, Erik, DE REYCK, Bert, HERROELEN, Willy |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2000
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/lkcsb_research/6746 https://doi.org/10.1080/07408170008967461 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Local search methods for the discrete time/resource trade-off problem in project networks
by: DE REYCK, Bert, et al.
Published: (1998) -
New computational results on the discrete time/cost trade-off problem in project networks
by: DEMEULEMEESTER, Erik, et al.
Published: (1998) -
Resource-constrained project scheduling: A survey of recent developments
by: HERROELEN, Willy, et al.
Published: (1996) -
A classification scheme for project scheduling problems
by: HERROELEN, Willy, et al.
Published: (1999) -
A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
by: DE REYCK, Bert, et al.
Published: (1998)