A double genetic algorithm for the MRCPSP/max
- 31 January 2011
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 38 (1), 33-43
- https://doi.org/10.1016/j.cor.2009.09.019
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Experimental investigation of heuristics for resource-constrained project scheduling: An updateEuropean Journal of Operational Research, 2006
- Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with genetic algorithmsJournal of the Operational Research Society, 2003
- A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lagsEuropean Journal of Operational Research, 2003
- A Constraint-Based Method for Project Scheduling with Time WindowsJournal of Heuristics, 2002
- Resource–constrained project scheduling: a heuristic for the multi–mode caseOR Spectrum, 2001
- Project Scheduling with Multiple Modes: A Genetic AlgorithmAnnals of Operations Research, 2001
- A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence ConstraintsManagement Science, 2000
- Resource-constrained project scheduling: Notation, classification, models, and methodsEuropean Journal of Operational Research, 1999
- Scheduling project networks with resource constraints and time windowsAnnals of Operations Research, 1988
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972