Solving Resource-Constrained Network Problems by Implicit Enumeration—Preemptive Case

1 June 1972

journal article
Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research

Vol. 20 (3) , 668-677
https://doi.org/10.1287/opre.20.3.668

Abstract

This paper treats the scheduling problem that has both precedence constraints (of a general form as in PERT-CPM problems) and resource constraints (of the form in the general job-shop scheduling problem). Preemptive-resume without changeover times is allowed. An efficient procedure for enumerating all active schedules is given. For the objective of minimizing the project length, a branch-and-bound algorithm is developed by adding a bounding procedure to the enumerative scheme. Computational experience is given.

Keywords

PREEMPTIVE
ENUMERATION
CONSTRAINTS
BRANCH
PRECEDENCE
ENUMERATIVE
IMPLICIT
SCHEME
RESUME
CPM

This publication has 0 references indexed in Scilit: