Uroš Klanšek (Author), Mirko Pšunder (Author)

Abstract

This paper presents the cost optimal project scheduling. The optimization was performed by the nonlinear programming approach, NLP The nonlinear total project cost objective function is subjected to the rigorous system of the activity preceden- ce relationship constraints, the activity duration constraints and the project duration constraints. The set of activity precedence relationship constraints was defined to comprise Finish-to-Start, Start-to-Start, Start-to-Finish and Finish-to-Finish precedence relationships between activities. The activity duration constraints determine relationships between minimum, maximum and possible duration of the project activities. The project duration constraints define the maximum feasible project duration. A numerical example is presented at the end of the paper in order to present the applicability of the proposed approach.

Keywords

project management;scheduling;optimization;nonlinear programming;NLP;

Data

Language: English
Year of publishing:
Typology: 1.01 - Original Scientific Article
Organization: UM FS - Faculty of Mechanical Engineering
Publisher: Moderna organizacija
UDC: 658.5
COBISS: 12437270 Link will open in a new window
ISSN: 1318-5454
Parent publication: Organizacija
Views: 1115
Downloads: 350
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Other data

Secondary language: Slovenian
Secondary title: Stroškovno optimalno planiranje projektov
Secondary abstract: V članku je predstavljeno stroškovno optimalno planiranje projektov. Optimiranje je izvedeno s pristopom nelinearnega programiranja, NLP Nelinearna namenska funkcija celotnih stroškov projekta je podvržena rigoroznemu sistemu pogojnih neenačb časovnih odvisnosti med aktivnostmi, trajanja aktivnosti in trajanja projekta. Množica pogojnih neenačb časovnih odvisnosti med aktivnostmi vključuje časovne povezave konec-začetek, začetek-začetek, začetek-konec in konec-konec. Pogojne neenačbe trajanja aktivnosti določajo odnose med minimalnim, maksimalnim in možnim časom trajanja projektnih aktivnosti. Pogojne (ne)enačbe trajanja projekta omejijo maksimalni možni čas trajanja projekta. Za predstavitev uporabnosti predlaganega pristopa je na koncu članka prikazan računski primer.
Secondary keywords: project management;scheduling;optimization;nonlinear programming;NLP;projektni management;planiranje;optimizacija;nelinearno programiranje;
URN: URN:NBN:SI
Type (COBISS): Scientific work
Pages: str. 153-158
Volume: ǂLetn. ǂ41
Issue: ǂšt. ǂ4
Chronology: 2008
DOI: 10.2478/v10051-008-0017-3
ID: 1736652