Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/12394
Title: Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness
Authors: Cheng, TCE 
Hsu, CJ
Huang, YC
Lee, WC
Keywords: Deteriorating jobs
Maximum tardiness
Setup time
Single-machine scheduling
Issue Date: 2011
Publisher: Pergamon Press
Source: Computers and operations research, 2011, v. 38, no. 12, p. 1760-1765 How to cite?
Journal: Computers and operations research 
Abstract: In many realistic production situations, a job processed later consumes more time than the same job when it is processed earlier. Production scheduling in such an environment is known as scheduling with deteriorating jobs. However, research on scheduling problems with deteriorating jobs has rarely considered explicit (separable) setup time (cost). In this paper, we consider a single-machine scheduling problem with deteriorating jobs and setup times to minimize the maximum tardiness. We provide a branch-and-bound algorithm to solve this problem. Computational experiments show that the algorithm can solve instances up to 1000 jobs in reasonable time.
URI: http://hdl.handle.net/10397/12394
ISSN: 0305-0548
EISSN: 1873-765X
DOI: 10.1016/j.cor.2010.11.014
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

25
Last Week
0
Last month
2
Citations as of Apr 12, 2018

WEB OF SCIENCETM
Citations

19
Last Week
0
Last month
Citations as of Apr 2, 2018

Page view(s)

70
Last Week
6
Last month
Citations as of Apr 16, 2018

Google ScholarTM

Check

Altmetric


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