𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Using an enhanced scatter search algorithm for a resource-constrained project scheduling problem

✍ Scribed by M. D. Mahdi Mobini; M. Rabbani; M. S. Amalnik; J. Razmi; A. R. Rahimi-Vahed

Publisher
Springer
Year
2008
Tongue
English
Weight
554 KB
Volume
13
Category
Article
ISSN
1432-7643

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

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