Rescheduling on identical parallel machines with machine disruptions to minimize total completion time

•Rescheduling with machine disruptions on identical parallel machines is studied.•The trade-off between the disruption cost and scheduling criterion is addressed.•Computational complexity status and efficient solution procedures are provided.•Numerical studies are conducted to evaluate the performan...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research Vol. 252; no. 3; pp. 737 - 749
Main Authors: Yin, Yunqiang, Cheng, T.C.E., Wang, Du-Juan
Format: Journal Article
Language:English
Published: Amsterdam Elsevier B.V 01.08.2016
Elsevier Sequoia S.A
Subjects:
Algorithms
Approximation
Assignment problem
Bicriterion analysis
Combinatorial optimization
Completion time
Deviation
Disruption
Job shops
Mathematical models
Pareto optimum
Polynomials
Production
Production scheduling
Rescheduling
Schedules
Scheduling algorithms
Studies
Tradeoff analysis
Tradeoffs
Two-dimensional fully polynomial-time approximation scheme
Rescheduling
Combinatorial optimization
Bicriterion analysis
Two-dimensional fully polynomial-time approximation scheme
Production
ISSN:0377-2217, 1872-6860
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:•Rescheduling with machine disruptions on identical parallel machines is studied.•The trade-off between the disruption cost and scheduling criterion is addressed.•Computational complexity status and efficient solution procedures are provided.•Numerical studies are conducted to evaluate the performance of the algorithms. We consider a scheduling problem where a set of jobs has already been assigned to identical parallel machines that are subject to disruptions with the objective of minimizing the total completion time. When machine disruptions occur, the affected jobs need to be rescheduled with a view to not causing excessive schedule disruption with respect to the original schedule. Schedule disruption is measured by the maximum time deviation or the total virtual tardiness, given that the completion time of any job in the original schedule can be regarded as an implied due date for the job concerned. We focus on the trade-off between the total completion time of the adjusted schedule and schedule disruption by finding the set of Pareto-optimal solutions. We show that both variants of the problem are NP-hard in the strong sense when the number of machines is considered to be part of the input, and NP-hard when the number of machines is fixed. In addition, we develop pseudo-polynomial-time solution algorithms for the two variants of the problem with a fixed number of machines, establishing that they are NP-hard in the ordinary sense. For the variant where schedule disruption is modeled as the total virtual tardiness, we also show that the case where machine disruptions occur only on one of the machines admits a two-dimensional fully polynomial-time approximation scheme. We conduct extensive numerical studies to evaluate the performance of the proposed algorithms.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2016.01.045