𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Local search for nonpreemptive multi-mode resource-constrained project scheduling

✍ Scribed by RAINER KOLISCH; ANDREAS DREXL

Book ID
110372554
Publisher
Taylor and Francis Group
Year
1997
Tongue
English
Weight
530 KB
Volume
29
Category
Article
ISSN
0740-817X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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