Article: An MINLP model for project scheduling with feeding buffer Journal: International Journal of Applied Decision Sciences (IJADS) 2024 Vol.17 No.6 pp.710 - 732 Abstract: This study addresses a critical chain project scheduling (CCPS) problem regarding the feeding buffer. The main contribution of this study lies in determining the critical chain when the feeding buffer is considered along with the project buffer, a less addressed issue in the critical chain literature. Using a mixed-integer nonlinear programming (MINLP) model, the critical chain of a project with no break-down and no overflow is found. Moreover, the impact of the feeding buffer on the criticality of activities is discussed. The problem is solved using the Lingo software package for validation in small-sized instances. Since the CCPS is known as an NP-hard problem, a genetic algorithm (GA) is also designed to solve large-scale instances. The algorithm's performance is confirmed using various project scheduling library test problems. Sensitivity analysis is implemented based on some crucial parameters, and the critical chain is analysed after conducting several experiments. It is shown how considering the feeding buffer makes different critical chains and how shortlisting activities and resources are optimally managed. Inderscience Publishers - linking academia, business and industry through research

Title: An MINLP model for project scheduling with feeding buffer

Authors: Ashkan Ayough; Masood Rabieh; Mohammad Naeem Javadi; Behrooz Khorshidvand

Addresses: Industrial Management Department, Faculty of Management & Accounting, Shahid Beheshti University, Tehran, Iran ' Industrial Management Department, Faculty of Management & Accounting, Shahid Beheshti University, Tehran, Iran ' Industrial Management Department, Faculty of Management & Accounting, Shahid Beheshti University, Tehran, Iran ' Iran Centre for Management Studies (ICMS), Tehran, Iran

Abstract: This study addresses a critical chain project scheduling (CCPS) problem regarding the feeding buffer. The main contribution of this study lies in determining the critical chain when the feeding buffer is considered along with the project buffer, a less addressed issue in the critical chain literature. Using a mixed-integer nonlinear programming (MINLP) model, the critical chain of a project with no break-down and no overflow is found. Moreover, the impact of the feeding buffer on the criticality of activities is discussed. The problem is solved using the Lingo software package for validation in small-sized instances. Since the CCPS is known as an NP-hard problem, a genetic algorithm (GA) is also designed to solve large-scale instances. The algorithm's performance is confirmed using various project scheduling library test problems. Sensitivity analysis is implemented based on some crucial parameters, and the critical chain is analysed after conducting several experiments. It is shown how considering the feeding buffer makes different critical chains and how shortlisting activities and resources are optimally managed.

Keywords: critical chain project scheduling; CCPS; feeding buffer; genetic algorithm.

DOI: 10.1504/IJADS.2024.141842

International Journal of Applied Decision Sciences, 2024 Vol.17 No.6, pp.710 - 732

Received: 21 Feb 2022
Accepted: 06 Jul 2022
Published online: 02 Oct 2024 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article

Title: An MINLP model for project scheduling with feeding buffer

Keep up-to-date