Robust Buffer Allocation for Scheduling of a Project with Predefined Milestones | Zendy

Marcin Klimek | Zendy; P. Łebkowski | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Robust Buffer Allocation for Scheduling of a Project with Predefined Milestones

Author(s) -

Marcin Klimek,

P. Łebkowski

Publication year - 2009

Publication title -

decision making in manufacturing and services

Language(s) - English

Resource type - Journals

eISSN - 2300-7087

pISSN - 1896-8325

DOI - 10.7494/dmms.2009.3.2.49

Subject(s) - computer science , scheduling (production processes) , usability , robustness (evolution) , buffer (optical fiber) , operations research , distributed computing , real time computing , mathematical optimization , operating system , engineering , telecommunications , biochemistry , chemistry , mathematics , gene

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research