Operational fixed job scheduling problem under spread time constraints a branch and price algorithm

İngilizce (OpenAlex)

O. Solyalia & Ö. Özpeynirciab* a Department of Industrial Engineering, Middle East Technical University , Ankara, 06531, Turkey b Institutional Development Office, Scientific and Technological Research Council of Turkey , Antara, 06100, Turkey * E-mail: ozgur.ozpeynirci@tubitak.gov.tr This study addresses the operational fixed job scheduling problem under spread time constraints. The problem is to select a subset of jobs having fixed ready times and deadlines for processing on identical parallel machines such that total weight of the selected jobs is maximised. We first give a mathematical formulation of the problem and then reformulate it using Dantzig-Wolfe decomposition. We propose a branch-and-price algorithm that works on the reformulation of the problem. Computational results show that our algorithm is far superior to its competitor in the literature. It solves instances that could not be solved in one hour CPU time in less than a second and is able to solve large-scale instances in reasonable times which make it a computationally viable tool for decision-making.