Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/12667
Title: Two-stage flowshop scheduling with a common second-stage machine
Authors: Oguz, C
Lin, BMT
Cheng, TCE 
Issue Date: 1997
Publisher: Pergamon Press
Source: Computers and operations research, 1997, v. 24, no. 12, p. 1169-1174 How to cite?
Journal: Computers and operations research 
Abstract: This article considers minimizing the makespan in a two-stage flowshop scheduling problem with a common second-stage machine. After introducing the problem, we show that it is Nn P-hard and give two special cases which are polynomially solvable. Next, we propose a heuristic algorithm and analyze its worst-case error bound. We then develop some lower bounds. Finally, we perform some computational experiments to test the average performance of the proposed heuristic.
URI: http://hdl.handle.net/10397/12667
ISSN: 0305-0548
EISSN: 1873-765X
DOI: 10.1016/S0305-0548(97)00023-3
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

32
Last Week
0
Last month
0
Citations as of Sep 15, 2017

WEB OF SCIENCETM
Citations

27
Last Week
0
Last month
0
Citations as of Sep 20, 2017

Page view(s)

45
Last Week
3
Last month
Checked on Sep 18, 2017

Google ScholarTM

Check

Altmetric



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