A New Implementation of the Critical Path Method Using Lexicographical Ordering of Edges

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F01%3APU21349" target="_blank" >RIV/00216305:26210/01:PU21349 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
A New Implementation of the Critical Path Method Using Lexicographical Ordering of Edges
Original language description
Critical Path Method (CPM) is well known tool in project scheduling where time duration of activities and their precedence relationships are defined and resource capacities are not limited. In practice it usually is not satisfied. In spite of this, the CPM is a base of more general methods as PERT, solving the Resource Constrained Project Scheduling Problem (RCPSP), and Job Shop Scheduling Problem (JSSP) when it is represented by the disjunctive graph. RCPSP and JSSP are NP-hard problems and therefore iit is necessary to solve them by heuristic methods. Here, with respect to high number of iterations, the effectiveness of the CPM calculations plays a substantial role. This contribution proposes a new implementation of the CPM using a lexicographical ordering of edges in network graphs and shows that its time complexity is lower than the time complexity of classical approaches. This conclusion is verified using the representative class of benchmarks.
Czech name
—
Czech description
—

Publication year
2001
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Proceedings of the 35th Spring International Conference Modelling and Simulation of Systems MOSIS '01
ISBN
80-85988-57-7
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
333-338
Publisher name
MARQ Ostrava
Place of publication
Ostrava
Event location
Hradec nad Moravicí
Event date
May 9, 2001
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—

Similar results(10)