The discrete time/resource trade-off problem in project networks: A branch-and-bound approach

Publication Type

Journal Article

Publication Date

11-2000

Abstract

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 activities have a total work content which indicates how much work (expressed in man-periods) has to be performed. The objective then is to schedule each activity in one of its possible execution modes, subject to the precedence and resource constraints, in order to minimize the project makespan. We present a branch-and-bound procedure and report computational results, obtained using a full factorial experiment on a randomly generated problem set.

Keywords

Computational complexity, Constraint theory, Problem solving

Discipline

Operations and Supply Chain Management | Operations Research, Systems Engineering and Industrial Engineering

Research Areas

Operations Management

Publication

IIE Transactions

Volume

32

Issue

11

First Page

1059

Last Page

1069

ISSN

0740-817X

Identifier

10.1080/07408170008967461

Publisher

Taylor & Francis: STM, Behavioural Science and Public Health Titles

Embargo Period

8-31-2021

Additional URL

https://doi.org/10.1080/07408170008967461

Link to Full Text

Share

COinS