Scheduling project networks with resource constraints and time windows
Annals of Operations Research
Evolution-based scheduling of multiple variant and multiple processor programs
Future Generation Computer Systems - Special issue on bio-impaired solutions to parallel processing problems
Serial and Parallel Genetic Algorithms as Function Optimizers
Proceedings of the 5th International Conference on Genetic Algorithms
The Distributed Genetic Algorithm Revisited
Proceedings of the 6th International Conference on Genetic Algorithms
Proceedings of the 11 IPPS/SPDP'99 Workshops Held in Conjunction with the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing
New upper bounds for the permutation flowshop scheduling problem
IEA/AIE'2005 Proceedings of the 18th international conference on Innovations in Applied Artificial Intelligence
ISDA '06 Proceedings of the Sixth International Conference on Intelligent Systems Design and Applications - Volume 02
Hi-index | 0.00 |
The multi-mode resource-constrained project scheduling problem with minimum and maximum time lags is considered in the paper. An activity is performed in a mode, which determines the demand of renewable and nonrenewable resources required for its processing and minimum and maximum time lags between adjacent activities. The goal is to find a mode assignment to the activities and their start times such that all constraints are satisfied and the project duration is minimized. Because the problem is NP-hard a population-learning algorithm (PLA2) is proposed to tackle the problem. PLA2 is a population-based approach which takes advantage of the features common to the social education system rather than to the evolutionary processes. The proposed approach perfectly suits for multi-agent systems because it is based on the idea of constructing a hybrid algorithm integrating different optimization techniques complementing each other and producing a synergetic effect. Results of the experiment were compared to the results published in Project Scheduling Problem Library.