Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/19329
Title: Minimizing total completion time in a two-machine flow shop with deteriorating jobs
Authors: Wang, JB
Ng, CTD 
Cheng, TCE 
Liu, LL
Keywords: Branch-and-bound algorithm
Flow shop
Scheduling
Simple linear deterioration
Total completion time
Issue Date: 2006
Publisher: Elsevier
Source: Applied mathematics and computation, 2006, v. 180, no. 1, p. 185-193 How to cite?
Journal: Applied mathematics and computation 
Abstract: This paper considers a two-machine flow shop scheduling problem with deteriorating jobs. By a deteriorating job, we mean that the processing time of a job is an increasing function of its execution start time. A simple linear deterioration function is assumed. The objective is to find a sequence that minimizes total completion time. Optimal solutions are obtained for some special cases. For the general case, several dominance properties and two lower bounds are derived to speed up the elimination process of a branch-and-bound algorithm. A heuristic algorithm is also proposed to overcome the inefficiency of the branch-and-bound algorithm. Computational results show that the proposed heuristic algorithm performs effectively and efficiently.
URI: http://hdl.handle.net/10397/19329
ISSN: 0096-3003
EISSN: 1873-5649
DOI: 10.1016/j.amc.2005.11.162
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

59
Last Week
0
Last month
1
Citations as of Aug 20, 2017

WEB OF SCIENCETM
Citations

61
Last Week
0
Last month
1
Citations as of Aug 20, 2017

Page view(s)

52
Last Week
1
Last month
Checked on Aug 20, 2017

Google ScholarTM

Check

Altmetric



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