Solving resource-constrained project scheduling problem as a sequence of multi-knapsack problems

Authors:
Miloš Šeda
Affiliations:
Institute of Automation and Computer Science, Brno University of Technology, Brno, Czech Republic
Venue:
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Year:
2006

Citing 5
Cited 0

Modern heuristic techniques for combinatorial problems

Modern heuristic techniques for combinatorial problems
Scheduling in Computer and Manufacturing Systems

Scheduling in Computer and Manufacturing Systems
A high-performance exact method for the resource-constrained project scheduling problem

Computers and Operations Research
How to Solve It: Modern Heuristics

How to Solve It: Modern Heuristics
Hybrid genetic algorithm with adaptive abilities for resource-constrained multiple project scheduling

Computers in Industry - Special issue: Application of genetics algorithms in industry

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a new technique for solving the duration minimization in a resource-constrained network. It is based on a transformation of the resource-constrained project scheduling problem (RCPSP) to a sequence of (multi)knapsack problem (MKP) solutions. In the first part, three deterministic approaches are summarized and their time complexity is discussed. Due to the combinatorial nature of the problem for large projects with many constraints, heuristic techniques are applied. A genetic algorithm approach is proposed and compared with simulated annealing.