Publication detail

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

ŠEDA, M.

Original Title

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

Type

journal article - other

Language

English

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.

Keywords

Resource-Constrained Project Scheduling Problem, Multi-Knapsack Problem

Authors

ŠEDA, M.

RIV year

2006

Released

1. 7. 2006

ISBN

1790-0832

Periodical

WSEAS Transactions on Information Science and Applications

Year of study

3

Number

10

State

Hellenic Republic

Pages from

1785

Pages to

1791

Pages count

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