Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/27334
Title: Four single-machine scheduling problems involving due date determination decisions
Authors: Yin, Y
Liu, M
Cheng, TCE 
Wu, CC
Cheng, SR
Keywords: Due date assignment
Past-sequence-dependent delivery time
Position-dependent learning effect
Scheduling
Issue Date: 2013
Source: Information sciences, 2013, v. 251, p. 164-181 How to cite?
Journal: Information Sciences 
Abstract: This paper considers single-machine scheduling problems with simultaneous consideration of due date assignment, past-sequence-dependent (p-s-d) delivery times, and position-dependent learning effects. By p-s-d delivery times, we mean that the delivery time of a job is proportional to the job's waiting time. Specifically, we study four variants of the problem: (i) the variant of total earliness and tardiness with common due date assignment (referred to as TETDC), (ii) the variant of total earliness and weighted number of tardy jobs with CON due date assignment (referred to as TEWNTDC), (iii) the variant of total earliness and weighted number of tardy jobs with slack due date assignment (referred to as TEWNTDS), and (iv) the variant of weighted number of tardy jobs with different due date assignment (referred to as WNTDD). We derive the structural properties of the optimal schedules and show that the variants TETDC, TEWNTDC and TEWNTDS are all polynomially solvable. Although the complexity status of the variant WNTDD is still open, we show that two special cases of it are polynomially solvable.
URI: http://hdl.handle.net/10397/27334
ISSN: 0020-0255
DOI: 10.1016/j.ins.2013.06.035
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

18
Citations as of Feb 15, 2017

WEB OF SCIENCETM
Citations

15
Last Week
0
Last month
1
Citations as of Feb 19, 2017

Page view(s)

27
Last Week
2
Last month
Checked on Feb 19, 2017

Google ScholarTM

Check

Altmetric



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