A genetic algorithm for multi-mode resource constrained project scheduling problem
- 1 July 1997
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 100 (1), 134-141
- https://doi.org/10.1016/s0377-2217(96)00180-4
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- A genetic algorithm for the job shop problemComputers & Operations Research, 1995
- A genetic algorithm for flowshop sequencingComputers & Operations Research, 1995
- A Random Activity Network GeneratorOperations Research, 1993
- NONPREEMPTIVE MULTI-MODE RESOURCE-CONSTRAINED PROJECT SCHEDULINGIIE Transactions, 1993
- A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling ProblemManagement Science, 1992
- A multi-stage non-deterministic model for project scheduling under resources constraintsEuropean Journal of Operational Research, 1990
- Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problemsEuropean Journal of Operational Research, 1990
- Project scheduling with resource constraints: A branch and bound approachEuropean Journal of Operational Research, 1987
- Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive CaseManagement Science, 1982
- An Algorithm for Optimal Project Scheduling under Multiple Resource ConstraintsManagement Science, 1971