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

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 b...

Full description

Saved in:
Bibliographic Details
Published in:Journal of scheduling 2019-10, Vol.22 (5), p.543-565
Main Authors: Bülbül, Kerem, Kedad-Sidhoum, Safia, Şen, Halil
Format: Article
Language:English
Subjects:
Algorithms
Artificial Intelligence
Business and Management
Calculus of Variations and Optimal Control
Optimization
Computer Science
Dynamic programming
Job shops
Operations Research/Decision Theory
Optimization
Polynomials
Production scheduling
Scheduling
Supply Chain Management
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 so 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 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.
ISSN:1094-6136
1099-1425
DOI:10.1007/s10951-018-0585-x