Resource-constrained project scheduling: a survey of recent developments
Computers and Operations Research
Scheduling Multiprocessor Tasks with Genetic Algorithms
IEEE Transactions on Parallel and Distributed Systems
Future Generation Computer Systems
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing
IEEE Transactions on Parallel and Distributed Systems
A Genetic Algorithm for Multiprocessor Scheduling
IEEE Transactions on Parallel and Distributed Systems
A New Approach to Solve Permutation Scheduling Problems with Ant Colony Optimization
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Integrating List Heuristics into Genetic Algorithms for Multiprocessor Scheduling
SPDP '96 Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)
(R) FAST: A Low-Complexity Algorithm for Efficient Scheduling of DAGs on Parallel Processors
ICPP '96 Proceedings of the Proceedings of the 1996 International Conference on Parallel Processing - Volume 2
Genetic-algorithm-based real-time task scheduling with multiple goals
Journal of Systems and Software - Special issue: Computer systems
Combining competitive scheme with slack neurons to solve real-time job scheduling problem
Expert Systems with Applications: An International Journal
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Ant colony optimization for resource-constrained project scheduling
IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Scheduling multiprocessor job with resource and timing constraintsusing neural networks
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Hi-index | 0.00 |
This study presents and evaluates a modified ant colony optimization (ACO) approach for the precedence and resource-constrained multiprocessor scheduling problems. A modified ant colony system, with two designed rules, called dynamic and delay ant colony system, is proposed to solve the scheduling problems. The dynamic rule is designed to modify the latest starting time of jobs and hence the heuristic function. A delay solution generation rule in exploration of the search solution space is used to escape the local optimal solution. Simulation results demonstrate that the proposed modified ant colony system algorithm provides an effective and efficient approach for solving multiprocessor system scheduling problems with precedence and resource constraints.