A branch-and-price algorithm for the single machine scheduling problem with periodic maintenance to minimize makespan

Periodic maintenance of machines is essential to prevent unexpected breakdowns and ensure safe and reliable production. In this paper, we address the single machine scheduling problem with periodic maintenance, where a set of jobs must be processed sequentially on a single machine that requires peri...

Full description

Saved in:

Bibliographic Details
Published in:	Computers & operations research Vol. 184; p. 107214
Main Authors:	Fei, Aiyue, Hu, Qian, Liu, Ying
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.12.2025
Subjects:	Branch-and-price Makespan Periodic maintenance Scheduling Single machine scheduling Scheduling Makespan Branch-and-price Single machine scheduling Periodic maintenance
ISSN:	0305-0548
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	Periodic maintenance of machines is essential to prevent unexpected breakdowns and ensure safe and reliable production. In this paper, we address the single machine scheduling problem with periodic maintenance, where a set of jobs must be processed sequentially on a single machine that requires periodic maintenance, with the objective of minimizing makespan. We first formulate this problem as a set partitioning model consisting of a set of integer variables and a set of continuous variables, and then develop a branch-and-price algorithm to efficiently solve the set partitioning model. In the algorithm, we design a hierarchical branching strategy to generate child nodes, a primal heuristic to quickly generate feasible solutions from fractional solutions, and a label setting algorithm with a bounding procedure to address pricing problems. Extensive computational experiments on benchmark instances and newly generated instances have been conducted to evaluate the efficiency of our branch-and-price algorithm. The results demonstrate that our algorithm solving the set partitioning model significantly outperforms the Gurobi Optimizer solving existing mathematical models in the literature, owing to our well-designed branching strategy, primal heuristic, and bounding procedure. •Study the single machine scheduling problem with periodic maintenance.•Propose a set partitioning model with fewer integer variables for the problem.•Develop a branch-and-price algorithm to solve the problem optimally.•Computational results demonstrate the efficiency of our exact algorithm.
ISSN:	0305-0548
DOI:	10.1016/j.cor.2025.107214