Decomposition based extended project scheduling for make-to-order production

• Published in: Operational research 2021-06, Vol.21 (2), p.801-825
• Main Authors: Turkgenci, Arda, Guden, Huseyin, Gülşen, Mehmet
• Format: Article
• Language: English
• Subjects: Business and Management; Complexity; Computational Intelligence; Critical path; Decomposition; Management Science; Mathematical analysis; Operations Research; Operations Research/Decision Theory; Original Paper; Produce to order; Production scheduling; Project management; Project planning; Resource scheduling; Scheduling
• ISSN: 1109-2858; 1866-1505
• DOI: 10.1007/s12351-019-00468-2

Project scheduling has a critical function for many companies. Although there is a vast literature dedicated to the development of solution methodologies, the real-life applications of those techniques are few and often require over-simplification of the real-life problem. This study deals with the implementation of a project scheduling routine for a “make-to-order” machinery manufacturer. Although the problem is very similar to a resource-constrained project scheduling problem (RCPSP), which is a well-known and well-studied problem in the literature, it has multi-project and multi-mode components which make the project planning more challenging. Because of the multi-dimensional complexity of the problem, it is called a “Rich Project Scheduling Problem”. Our approach employs two techniques to deal with the issue of complexity. The first one is regarding calculation of the latest start time for each activity in the project. The second one is the decomposition method that includes breaking down the big problem into small manageable pieces. The approach was tested on real-life problems of a machine-building company. We also built more complex test cases from the real projects for testing purposes. Our approach produced high-quality solutions to the complex project scheduling problems within reasonable time limits. This work contributes to current research in several ways. An extension to the RCPSP formulation to include multi-project and multi-mode problems is introduced and successfully used for solving real-life problems. Additionally, activities of an RCPSP can be split into multiple sub-activities. Doing so is called preemption. The proposed formulation permits mode-switching during the execution of an activity, and it uses an alternative methodology to calculate latest activity start times.