Single-machine common due date total earliness/tardiness scheduling with machine unavailability

Abstract

Research on non-regular performance measures is at best scarce in the deterministic machine scheduling literature with machine unavailability constraints. Moreover, almost all existing works in this area assume either that processing on jobs interrupted by an interval of machine unavailability may be resumed without any additional setup/processing or that all prior processing is lost. In this work, we intend to partially fill these gaps by studying the problem of scheduling a single machine as to minimize the total deviation of the job completion times from an unrestrictive common due date when one or several fixed intervals of unavailability are present in the planning horizon. We also put a serious effort into investigating models with semi-resumable jobs so that processing on a job interrupted by an interval of machine unavailability may later be resumed at the expense of some extra processing time. The conventional assumptions regarding resumability are also taken into account. Several interesting cases are identified and explored, depending on the resumability scheme and the location of the interval of machine unavailability with respect to the common due date. The focus of analysis is on structural properties and drawing the boundary between polynomially solvable and NP−complete cases. Pseudo-polynomial dynamic programming algorithms are devised for NP−complete variants in the ordinary sense.

An exact quadratic programming approach based on convex reformulation for seru scheduling problems

“…For S‐ET r , the property of restrictive common due date implies that there is a job which starts before and ends after d r , that is, it is a straddling job (Bülbül et al, 2019). Figure 2 provides a seru scheduling example with the straddling job, in which nine jobs are needed to be scheduled in three serus .…”

Models for maintenance planning and scheduling – a citation-based literature review and content analysis

“…Earlier studies were conducted by Graves and Lee (1999), Lee and Chen (2000), Cassady and Kutanoglu (2003), among others. Recent developments have considered a wide range of extensions with the consideration of beyond common performance measures like makespan, or total competition time to early-tardy minimization (Su et al , 2017; Bülbül et al , 2019), flowshop and flexible manufacturing (Zandieh et al , 2017), aviation maintenance applications (Deng et al , 2020), other advanced maintenance strategies (Xu et al , 2020; Zeming et al , 2019; Blazewicz et al , 2019) and new algorithms for solution methodologies (Ying et al , 2016).…”

Minimizing JIT scheduling of unrelated parallel machine with family setups and soft time window constraints

“…Also, Zhu and Heady [9] and Omar and Teo [10] expanded mixed integer programming methods, in order to minimize the total earliness and tardiness for parallel machine scheduling with the constraint of family setup times and due date assignment. Considering fixed intervals of unavailability, Bülbül et al dealt with a single machine scheduling problem with an unrestrictive common due date to minimize the total deviation of the job completion times [11]. Kramer and Subramanian studied a large class of earliness/tardiness scheduling problems.…”