Detail publikace

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

ŠEDA, M.

Originální název

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

Typ

článek v časopise - ostatní, Jost

Jazyk

angličtina

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

Resource-Constrained Project Scheduling Problem, Multi-Knapsack Problem

Autoři

ŠEDA, M.

Rok RIV

2006

Vydáno

1. 7. 2006

ISSN

1790-0832

Periodikum

WSEAS Transactions on Information Science and Applications

Ročník

3

Číslo

10

Stát

Řecká republika

Strany od

1785

Strany do

1791

Strany počet

7

BibTex

@article{BUT43698,
  author="Miloš {Šeda}",
  title="Solving Resource-Constrained Project Scheduling Problem As a Sequence of Multi-Knapsack Problems",
  journal="WSEAS Transactions on Information Science and Applications",
  year="2006",
  volume="3",
  number="10",
  pages="7",
  issn="1790-0832"
}