Resource allocation for robust project scheduling

• Autorzy: Klimek M. , Łebkowski P.
• Języki publikacji: EN

Abstrakty

EN

The paper presents a formal description of the resource allocation problem for resource-constrained project scheduling. A schedule can be executed by various resource flow networks which may differ in terms of resistance to disruptions occurring during project execution. The authors define such criteria of evaluating a resource flow network which can be more useful than robustness metrics used so far in the research. The authors discuss the importance of robust scheduling for execution projects and propose metrics for resource allocation robustness which take into consideration the stability of the final schedule. Those metrics make it possible to carry out a more precise analysis concerning the properties of the resource flow network in terms of its robustness to disruptions in comparison with a well known flexibility indicator, flex.

Słowa kluczowe

EN

resource-constrained project scheduling; robust scheduling; resource allocation

• Wydawca: Polska Akademia Nauk, Wydział IV Nauk Technicznych
• Czasopismo: Bulletin of the Polish Academy of Sciences. Technical Sciences
• Rocznik: 2011
• Tom: Vol. 59, nr 1
• Strony: 51--55
• Opis fizyczny: Bibliogr. 9 poz., rys., tab.

Twórcy

autor

Klimek M.

autor

Łebkowski P.

• Institute of Informatics Pope John Paul II State School of Higher Education, 95-97 Sidorska St., 21-500 Biała Podlaska, Poland,

Bibliografia

• [1] D. Gąsior and J.Józefczyk, “Application of uncertain variables to production planning in a class of manufacturing systems”, Bull Pol. Ac.: Tech. 57 (3), 257–263 (2009).
• [2] M. Jensen., “Improving robustness and flexibility of tardiness and total flow-time job shops using robustness measures”, Applied Soft Computing 1, 35–52 (2001).
• [3] M. Al-Fawzan and M. Haouari, “A bi-objective problem for robust resource-constrained project scheduling”, Int. J. Production Economics 96, 175–187 (2005).
• [4] R. Leus and W. Herroelen, “Stability and resource allocation in project planning”, IIE Transactions 36 (7), 667–682 (2004).
• [5] C. Artigues, P. Michelon, and S. Reusser, “Insertion techniques for static and dynamic resource-constrained project scheduling”, Eur. J. Operational Research 149 (2), 249–267 (2003).
• [6] K. Braeckmans, E. Demeulemeester, W. Herroelen, and R. Leus, “Proactive resource allocation heuristics for robust project scheduling”, Research Report KBI 0567, K.U.Leuven, Leuven, 2005.
• [7] F. Deblaere, E. Demeulemeester, W. Herroelen, and S. Van De Vonder, “Proactive resource allocation heuristics for robust project scheduling”, Research Report KBI 0608, K.U.Leuven, Leuven, 2006.
• [8] N. Policella, “Scheduling with uncertainty – a proactive approach using partial order schedules”, Phd Thesis, University La Sapienza, Rome, 2005.
• [9] M. Klimek and P. Łebkowski, “Robust resource allocation algorithms for the resource-constrained project scheduling problem,” Automatics, Semiannual of the AGH University of Science and Technology of Kraków 13 (2), 371–379 (2009), (in Polish).