𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A competitive genetic algorithm for resource-constrained project scheduling

✍ Scribed by Sönke Hartmann

Publisher
John Wiley and Sons
Year
1998
Tongue
English
Weight
100 KB
Volume
45
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A metaheuristic scheduling procedure for
A metaheuristic scheduling procedure for resource-constrained projects with cash flows
✍ Dan Zhu; Rema Padman 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 244 KB 👁 1 views

Resource-constrained project scheduling problems with cash flows (RCPSPCF) are complex, combinatorial optimization problems. Many heuristics have been reported in the literature that produce reasonable schedules in limited project environments. However, the lack of a heuristic that dominates under d

Project scheduling using a genetic algor
Project scheduling using a genetic algorithm with adaptable changing genetic operators
✍ 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 methodology for comp
A genetic algorithm methodology for complex scheduling problems
✍ Bryan A. Norman; James C. Bean 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 79 KB 👁 1 views

This paper considers the scheduling problem to minimize total tardiness given multiple machines, ready times, sequence dependent setups, machine downtime and scarce tools. We develop a genetic algorithm based on random keys representation, elitist reproduction, Bernoulli crossover and immigration ty

A note on genetic algorithms for degree-
A note on genetic algorithms for degree-constrained spanning tree problems
✍ Zhou, Gengui; Gen, Mitsuo 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 58 KB 👁 2 views

The degree-constrained spanning tree problem is of high practical importance. Up to now, there are few effective algorithms to solve this problem because of its NP-hard complexity. In this paper, we present a new approach to solve this problem by using genetic algorithms and computational results to

A branch-and-cut algorithm for the resou
A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem
✍ Fischetti, Matteo; Vigo, Daniele 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 2 views

In this paper, we present a branch-and-cut algorithm for the exact solution of an NP-hard extension of the well-known Minimum-Weight Arborescence (MWA) problem, in which resource constraints for each node are considered. This Resource-Constrained Minimum-Weight Arborescence (RMWA) problem arises, e.