Single-machine scheduling and common due date assignment with potential machine disruption

This paper studies a single-machine due date assignment and scheduling problem in a disruptive environment, where a machine disruption may occur at a particular time that will last for a period of time with a certain probability, and the job due dates are determined by the decision-maker using the p...

Full description

Saved in:
Bibliographic Details
Published in:International journal of production research Vol. 56; no. 3; pp. 1345 - 1360
Main Authors: Xiong, Xiaoyun, Wang, Dujuan, Edwin Cheng, T.C., Wu, Chin-Chia, Yin, Yunqiang
Format: Journal Article
Language:English
Published: London Taylor & Francis LLC 01.02.2018
Subjects:
Adaptive algorithms
Adaptive search techniques
Algorithms
Cost analysis
Decision making
Job shops
Mathematical analysis
Polynomials
Production scheduling
Scheduling
Search algorithms
Sequential scheduling
ISSN:0020-7543, 1366-588X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper studies a single-machine due date assignment and scheduling problem in a disruptive environment, where a machine disruption may occur at a particular time that will last for a period of time with a certain probability, and the job due dates are determined by the decision-maker using the popular common due date assignment method. The goal is to determine jointly the optimal job sequence and the common due date so as to minimise the expected value of an integrated cost function that includes the earliness, tardiness and due date assignment costs. We analyse the computational complexity status of various cases of the problem, and develop pseudo-polynomial-time solution algorithms, randomised adaptive search algorithms, and fully polynomial-time approximation schemes for them, if viable. Finally, we conduct extensive numerical testing to assess the performance of the proposed algorithms.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0020-7543
1366-588X
DOI:10.1080/00207543.2017.1346317