Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/20035
Title: A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
Authors: Ng, CT 
Wang, J
Cheng, TCE 
Liu, LL
Keywords: Branch-and-bound algorithm
Deteriorating jobs
Flow shop
Scheduling
Total completion time
Issue Date: 2010
Publisher: Pergamon Press
Source: Computers and operations research, 2010, v. 37, no. 1, p. 83-90 How to cite?
Journal: Computers and operations research 
Abstract: In this paper we consider a two-machine flow shop scheduling problem with deteriorating jobs. By a deteriorating job we mean that the job's processing time is an increasing function of its starting time. We model job deterioration as a function that is proportional to a linear function of time. The objective is to find a sequence that minimizes the total completion time of the jobs. For the general case, we derive several dominance properties, some lower bounds, and an initial upper bound by using a heuristic algorithm, and apply them to speed up the elimination process of a branch-and-bound algorithm developed to solve the problem.
URI: http://hdl.handle.net/10397/20035
ISSN: 0305-0548
EISSN: 1873-765X
DOI: 10.1016/j.cor.2009.03.019
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

50
Last Week
0
Last month
1
Citations as of Oct 9, 2017

WEB OF SCIENCETM
Citations

43
Last Week
0
Last month
1
Citations as of Oct 15, 2017

Page view(s)

80
Last Week
5
Last month
Checked on Oct 15, 2017

Google ScholarTM

Check

Altmetric



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