Robust Buffer Allocation for Scheduling of a Project with Predefined Milestones

Authors

  • Marcin Klimek Pope John Paul II State School of Higher Vocational Education in Biała Podlaska
  • Piotr Łebkowski AGH University of Science and Technology

DOI:

https://doi.org/10.7494/dmms.2009.3.2.49

Keywords:

resource-constrained project scheduling, predictive-reactive scheduling, robust buffer allocation, milestones

Abstract

The paper discusses the problem of robust buffer allocation for Resource- Constrained Project Scheduling Problem (RCPSP) with predefined milestones, for which execution deadlines have been established. To solve the problem, an algorithm is proposed supporting insertion of unit time buffers, with the simultaneous maximisation of new metrics of arrangement robustness. The presented results of experimental research speak for usability of the solutions proposed. The effectiveness is studied with use of test tasks included in the Project Scheduling Problem Library (PSPLIB) with additionally specified project milestones.

Downloads

Published

2009-12-21

How to Cite

Klimek, M., & Łebkowski, P. (2009). Robust Buffer Allocation for Scheduling of a Project with Predefined Milestones. Decision Making in Manufacturing and Services, 3(2), 49–72. https://doi.org/10.7494/dmms.2009.3.2.49

Issue

Vol. 3 (2009): No. 1-2

Section

Articles

License

Remeber to prepeare, sign and scan copyright statement

Licencja Creative Commons
The content of the journal is freely available according to the Creative Commons License Attribution 4.0 International (CC BY 4.0)

Received 2013-08-22
Accepted 2013-08-22
Published 2009-12-21