𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Sepehr Proon; Mingzhou Jin

Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
204 KB
Volume
58
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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 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 πŸ‘ 2 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

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.