Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with genetic algorithms
- 1 June 2003
- journal article
- Published by Taylor & Francis Ltd in Journal of the Operational Research Society
- Vol. 54 (6), 614-626
- https://doi.org/10.1057/palgrave.jors.2601563
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Simulated Annealing for Multi-Mode Resource-Constrained Project SchedulingAnnals of Operations Research, 2001
- A genetic algorithm approach to a general category project scheduling problemIEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews), 1999
- Project scheduling with multiple modes: A comparison of exact algorithmsNetworks, 1998
- Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithmEuropean Journal of Operational Research, 1998
- An exact algorithm for project scheduling with multiple modesOR Spectrum, 1997
- A genetic algorithm for multi-mode resource constrained project scheduling problemEuropean Journal of Operational Research, 1997
- Resource-constrained project scheduling by simulated annealingInternational Journal of Production Research, 1996
- DSS for multiobjective project schedulingEuropean Journal of Operational Research, 1994
- AN ALGORITHM FOR A GENERAL CLASS OF PRECEDENCE AND RESOURCE CONSTRAINED SCHEDULING PROBLEMSPublished by Elsevier BV ,1989
- Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive CaseManagement Science, 1982