Scheduling project networks with resource constraints and time windows
Annals of Operations Research
Scheduling of project networks by job assignment
Management Science
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
A Constraint-Based Method for Project Scheduling with Time Windows
Journal of Heuristics
A-Team for solving MRCPSP/max problem
KES-AMSTA'11 Proceedings of the 5th KES international conference on Agent and multi-agent systems: technologies and applications
Double-action agents solving the MRCPSP/Max problem
ICCCI'11 Proceedings of the Third international conference on Computational collective intelligence: technologies and applications - Volume Part II
| Hi-index | 0.01 |
This paper presents a heuristic solution procedure for a very general resource-constrained project scheduling problem. Here, multiple execution modes are available for the individual activities of the project. In addition, minimum as well as maximum time lags between different activities may be given. The objective is to determine a mode and a start time for each activity such that the temporal and resource constraints are met and the project duration is minimised. Project scheduling problems of this type occur e.g. in process industries. The heuristic is a two-phased genetic algorithm with different representation, fitness, crossover operator, etc., in each of them. One of the contributions of the paper is the optimisation in the first phase of a problem dual to the original, the searching for the best modes of the activities. Computational results show that the algorithm outperforms the state-of-the-art algorithms in medium and large instances.