𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Project Scheduling with Multiple Modes: A Genetic Algorithm

✍ Scribed by Sönke Hartmann


Book ID
110295390
Publisher
Springer US
Year
2001
Tongue
English
Weight
160 KB
Volume
102
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Project scheduling with multiple modes:
✍ Hartmann, S�nke; Drexl, Andreas 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 1 views

This paper is devoted to a comparison of all available branch-and-bound algorithms that can be applied to solve resource-constrained project scheduling problems with multiple execution modes for each activity. After summarizing the two exact algorithms that have been suggested in the literature, we

Project scheduling using a genetic algor
✍ Tomoya Ikeuchi; Yoshitomo Ikkai; Dai Araki; Takenao Ohkawa; Norihisa Komoda 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 252 KB 👁 2 views

Genetic algorithms (GA) have been widely used to solve planning problems. However, they require one to determine the optimal values of many genetic parameters, such as population sizes, crossover probability, mutation probability, and so on. To make matters worse, the most suitable combination of pa

A genetic algorithm for multi-mode resou
✍ 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