✦ LIBER ✦

Two-Phase Genetic Local Search Algorithm for the Multimode Resource-Constrained Project Scheduling Problem

✍ Scribed by Lin-Yu Tseng; Shih-Chieh Chen

Book ID: 114625108
Publisher: IEEE
Year: 2009
Tongue: English
Weight: 403 KB
Volume: 13
Category: Article
ISSN: 1089-778X
DOI: 10.1109/tevc.2008.2011991

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient genetic algorithm for resource

Efficient genetic algorithm for resource-constrained project scheduling problem

✍ Hong Wang; Tongling Li; Dan Lin 📂 Article 📅 2010 🏛 Tianjin University 🌐 Chinese ⚖ 523 KB

A genetic algorithm with neighborhood se

A genetic algorithm with neighborhood search for the resource-constrained project scheduling problem

✍ Sepehr Proon; Mingzhou Jin 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB

Problem space search algorithms for reso

Problem space search algorithms for resource-constrained project scheduling

✍ Kedar S. Naphade; S. David Wu; Robert H. Storer 📂 Article 📅 1997 🏛 Springer US 🌐 English ⚖ 145 KB

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 hybrid genetic algorithm for the resou

A hybrid genetic algorithm for the resource-constrained project scheduling problem

✍ Vicente Valls; Francisco Ballestín; Sacramento Quintanilla 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 236 KB

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