Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/73932
Title: Single-machine scheduling and common due date assignment with potential machine disruption
Authors: Xiong, X
Wang, D
Cheng, TCE 
Wu, CC
Yin, Y
Keywords: Disruption management
Due date assignment
Dynamic programming
Fully polynomial-time approximation scheme
Scheduling
Issue Date: 2018
Publisher: Taylor & Francis
Source: International journal of production research, 2018, v. 56, no. 3, p. 1345-1360 How to cite?
Journal: International journal of production research 
Abstract: 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.
URI: http://hdl.handle.net/10397/73932
ISSN: 0020-7543
EISSN: 1366-588X
DOI: 10.1080/00207543.2017.1346317
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

2
Citations as of Mar 26, 2019

WEB OF SCIENCETM
Citations

1
Last Week
0
Last month
Citations as of Apr 8, 2019

Page view(s)

52
Last Week
2
Last month
Citations as of May 21, 2019

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.