A tool for comparing resource-constrained project scheduling problem algorithms

Authors:
Alexandru-Liviu Olteanu
Affiliations:
Computer Science and Automated Control, Faculty of Engineering, "Lucian Blaga" University of Sibiu, Sibiu, Romania
Venue:
AIC'09 Proceedings of the 9th WSEAS international conference on Applied informatics and communications
Year:
2009

Citing 10
Cited 0

The history and status of the P versus NP question

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Scheduling Algorithms

Scheduling Algorithms
Ant Colony Optimization

Ant Colony Optimization
One genetic algorithm for hierarchical covering location problem

EC'08 Proceedings of the 9th WSEAS International Conference on Evolutionary Computing
Parameter adjustment for genetic algorithm for two-level hierarchical covering location problem

WSEAS Transactions on Computers
An object-oriented framework with corresponding graphical user interface for developing ant colony optimization based algorithms

WSEAS Transactions on Computers
Ant colony optimization meta-heuristic in project scheduling

AIKED'09 Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases
A comparative assessment of ant colony optimization algorithms for the minimum weight vertex cover problem

AIKED'09 Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases
An analysis of different variations of ant colony optimization to the minimum weight vertex cover problem

WSEAS Transactions on Information Science and Applications
Ant colony optimization for resource-constrained project scheduling

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

There are a multitude of optimization problems that are difficult to solve and for which many algorithms have been developed. One area of these problems is scheduling, where a large range of constraints need to be upheld, making the problems NP-hard. The aim of this paper is to present a tool for comparing different methods for the Resource-Constrained Project Scheduling Problem.