PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Tytuł artykułu

Resource Allocation Optimization in Critical Chain Method

Treść / Zawartość
Identyfikatory
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
The paper presents resource allocation optimization in Critical Chain Project Management (CCPM). The cheapest project schedule is searched with respect to time constraints. The algorithm originally developed for the hardware-software co-design of heterogeneous distributed systems is adapted to work with human resources and CCPM method. The results of the optimization showed significant efficiency of the algorithm in comparison with a greedy algorithm. On average, the optimization gives 14.10% of cost reduction using the same number of resources. The gain varies depending on the number of resources and the time constraints. Advantages and disadvantages of such an approach are also discussed.
Rocznik
Strony
17--29
Opis fizyczny
Bibliogr. 9 poz., rys., tab.
Twórcy
autor
  • Department of Computer Science, Kielce University of Technology al.1000-lecia P.P. 7, Kielce, Poland
autor
  • Department of Computer Science, Kielce University of Technology al.1000-lecia P.P. 7, Kielce, Poland
Bibliografia
  • [1] Wei C., Liu P., Tsai Y., Resource-constrained project management using enhanced theory of constraint, International Journal of Project Management 20 (2002): 561.
  • [2] Rand G.K., Critical chain: the Theory of Constraints applied to project management, International Journal of Project Management 18 (3) (2000): 173.
  • [3] Tormos P., Lova A., Competitive Heuristic Solution Technique for Resource-Constrained Project Scheduling, Annals of Operations Research 102 (2001): 65.
  • [4] Deniziak S., Cost-efficient synthesis of multiprocessor heterogeneous systems, Control and Cybernetics 33 (2004): 341.
  • [5] Goldratt E.M., Critical Chain, The North River Press Publishing Corporation, Great Barrington (1997).
  • [6] Steyn H., An investigation into the fundamentals of critical chain project management, International Journal of Project Management 19 (2000): 363.
  • [7] Herroelen W., Leus R., On the merits and pitfalls of critical chain scheduling, Journal of Operations Management 19 (2001): 559.
  • [8] Deniziak S., Sapiecha K., Kosynteza rozproszonych systemów heterogenicznych (“Hardwaresoftware co-design of heterogenous distributed systems”), III Krajowa Konferencja: Metody I systemy komputerowe w badaniach naukowych i projektowaniu inzynierskim, Kraków (2001): 437 (in Polish).
  • [9] Tukel O. I., Rom W. O., Eksioglu S. D., An investigation of buffer sizing techniques in critical chain schedulin, European Journal of Operational Research 172 (2006): 401.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-beb83a17-ba98-4c25-87da-92b104069d32
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.