Integrated production scheduling and periodic maintenances on a single machine with release dates

Abstract

This paper addresses the production scheduling problem on a single machine with periodic maintenances, where the jobs' release dates are considered. For the resumable case, we prove that the problem can be solved in polynomial time. For the non-resumable case, we prove that the problem is strongly NP-Hard and propose an effective heuristic ERD-LPT based on the properties of optimal solutions. Then a branch-and-bound algorithm (B&B) that utilizes several dominance rules is developed to search the optimal schedules for the small-to-medium sized problems. Computational results indicate that the proposed heuristic is highly accurate compared with B&B and the improvement of performance is significant compared with the First-in-First-out (FIFO) rule.

Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times

“…Yu et al (2014) Min makespan -Approximation alg. Cui and Lu (2014) Min makespan Release dates B&B contributions of this article are i) to test the effectiveness of using arc-time-indexed formulations embedded within an iterative algorithm for the 1MPS, in which the number of maintenances is fixed at each iteration, ii) to develop an enhanced and innovative arc-time-indexed formulation for the 1MPS, iii) to provide new best-known solutions for several 1MPS benchmark instances, and iv) to generate and solve new and more challenging instances for the 1MPS. The remainder of the paper is organized as follows.…”

Exact and Meta-heuristic Approaches for the Single-machine Scheduling Problem with Flexible Maintenance under Human Resource Constraints

“…After that, surveys were presented to synthesize works before 2010 on scheduling with deterministic unavailability periods (see Schmidt (2000) and Ma et al (2010)). Cui and Lu (2014) consider the problem with periodic maintenance and production jobs with release dates to minimize the makespan in both resumable and non resumable case. They proposed a mathematical model, a specific heuristic and a branch and bound algorithm.…”