Detail publikace

Solving Resource-Constrained Project Scheduling Problem As a Sequence of Multi-Knapsack Problems

ŠEDA, M.

Anglický název

Solving Resource-Constrained Project Scheduling Problem As a Sequence of Multi-Knapsack Problems

Typ

Stať ve sborníku v databázi WoS či Scopus

Jazyk

en

Originální abstrakt

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.

Klíčová slova anglicky

Resource-Constrained Project Scheduling Problem, Multi-Knapsack Problem

Vydáno

2006-07-01

Nakladatel

WSEAS

Místo

Athens

ISBN

960-8457-47-5

Kniha

Proceedings of the 10th WSEAS International Conference on Computers

Strany od–do

80–

Počet stran

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"
}