Přístupnostní navigace
E-application
Search Search Close
Publication result detail
ŠEDA, M.
Original Title
Solving Resource-Constrained Project Scheduling Problem As a Sequence of Multi-Knapsack Problems
English Title
Type
Paper in proceedings (conference paper)
Original 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.
English abstract
Keywords
Resource-Constrained Project Scheduling Problem, Multi-Knapsack Problem
Key words in English
Authors
Released
01.07.2006
Publisher
WSEAS
Location
Athens
ISBN
960-8457-47-5
Book
Proceedings of the 10th WSEAS International Conference on Computers
Pages from
80
Pages count
7
BibTex
@inproceedings{BUT20352, author="Miloš {Šeda}", title="Solving Resource-Constrained Project Scheduling Problem As a Sequence of Multi-Knapsack Problems", booktitle="Proceedings of the 10th WSEAS International Conference on Computers", year="2006", pages="7", publisher="WSEAS", address="Athens", isbn="960-8457-47-5" }