๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The multiple resource constrained project scheduling problem: A breadth-first approach

โœ Scribed by Terence Nazareth; Sanjay Verma; Subir Bhattacharya; Amitava Bagchi

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
404 KB
Volume
112
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

โœฆ Synopsis

We describe a simple breadth-ยฎrst tree search scheme for minimizing the makespan of a project consisting of a partially ordered network of activities under multiple resource constraints. The method compares quite favourably with existing techniques that employ depth-ยฎrst or best-ยฎrst search; in particular, it is able to solve optimally on a Pentium PC running SCO UNIX the entire set of 680 benchmark problems (First Lot: 480, Second Lot: 200) generated by Kolisch et al., 1995. The new algorithm has also been checked out experimentally on additional random test problems at graded levels of diculty that were generated using two parameters: the threshold, which determined the predecessors of an activity, and the total resource availability of each resource type. The breadth-ยฎrst scheme can be modiยฎed quite readily to do best-ยฎrst search or to minimize measures other than makespan such as mean ยฏow time and maximum tardiness.

๐Ÿ“œ SIMILAR VOLUMES

A branch and bound algorithm for the res
A branch and bound algorithm for the resource-constrained project scheduling problem
โœ Peter Brucker; Sigrid Knust; Arno Schoo; Olaf Thiele ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 257 KB

A branch and bound algorithm is presented for the resource-constrained project scheduling problem (RCPSP). Given are n activities which have to be processed without preemptions. During the processing period of an activity constant amounts of renewable resources are needed where the available capacit

A genetic algorithm for multi-mode resou
A genetic algorithm for multi-mode resource constrained project scheduling problem
โœ Masao Mori; Ching Chih Tseng ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 540 KB

This article considers a general class of nonpreemptive multi-mode resource-constrained project scheduling problems in which activity durations depend on committed renewable resources (multi-mode time resource tradeoff). We propose a genetic algorithm for these problems and compare it with a stochas

Local search techniques for the generali
Local search techniques for the generalized resource constrained project scheduling problem
โœ Scott E. Sampson; Elliott N. Weiss ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 665 KB

In this article we address the problem of scheduling a single project network with both precedence and resource constraints through the use of a local search technique. We choose a solution definition which guarantees precedence feasibility, allowing the procedure to focus on overcoming resource inf