About: Solving Resource-Constrained Project Scheduling Problem As a Sequence of Multi-Knapsack Problems     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • Příspěvek popisuje novou techniku pro výpočet minimální doby trvání projektu v síti s omezenými zdroji. Je založena na transformaci problému rozvrhování projektů s omezenými zdroji na posloupnost řešení problémů vícekapacitního batohu. V první části jsoushrnuty tři deterministické přístupy a je diskutována jejich časová složitost. Vzhledem ke kombinatorické povaze problému jsou pro projekty velkého rozsahu použity heuristické metody. Jsou navrženy přístupy využívající genetický algoritmus a simulované žíhání a provedeno jejich srovnání. (cs)
  • 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 algoritthm approach is proposed and compared with simulated annealing.
  • 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 algoritthm approach is proposed and compared with simulated annealing. (en)
Title
  • Solving Resource-Constrained Project Scheduling Problem As a Sequence of Multi-Knapsack Problems
  • Řešení problému rozvrhování projektů s omezenými zdroji jako posloupnosti problémů vícekapacitního batohu (cs)
  • Solving Resource-Constrained Project Scheduling Problem As a Sequence of Multi-Knapsack Problems (en)
skos:prefLabel
  • Solving Resource-Constrained Project Scheduling Problem As a Sequence of Multi-Knapsack Problems
  • Řešení problému rozvrhování projektů s omezenými zdroji jako posloupnosti problémů vícekapacitního batohu (cs)
  • Solving Resource-Constrained Project Scheduling Problem As a Sequence of Multi-Knapsack Problems (en)
skos:notation
  • RIV/00216305:26210/06:PU62367!RIV06-MSM-26210___
http://linked.open.../vavai/riv/strany
  • 1785-1791
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • Z(MSM0021630518)
http://linked.open...iv/cisloPeriodika
  • 10
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 500282
http://linked.open...ai/riv/idVysledku
  • RIV/00216305:26210/06:PU62367
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • multi-knapsack problem, resource-constrained scheduling, genetic algorithm, simulated annealing (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • GR - Řecká republika
http://linked.open...ontrolniKodProRIV
  • [C1BBF593314A]
http://linked.open...i/riv/nazevZdroje
  • WSEAS Transactions on Information Science and Applications
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • 3
http://linked.open...iv/tvurceVysledku
  • Šeda, Miloš
http://linked.open...n/vavai/riv/zamer
issn
  • 1790-0832
number of pages
http://localhost/t...ganizacniJednotka
  • 26210
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software