Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/16547
Title: A note on scheduling the two-machine flexible flowshop
Authors: Cheng, TCE 
Wang, G
Keywords: Flexible manufacturing cell
Flowshop scheduling
Make-span minimization
Issue Date: 1999
Publisher: Institute of Electrical and Electronics Engineers
Source: IEEE transactions on robotics and automation, 1999, v. 15, no. 1, p. 187-190 How to cite?
Journal: IEEE transactions on robotics and automation 
Abstract: In this note we consider the NP-complete one-setup version of the two-machine flexible manufacturing cell scheduling problem studied by Lee and Mirchandani [5]. We provide a pseudopolynomial dynamic programming algorithm to solve the problem, thus establishing that the problem is NP-complete in the ordinary sense. We derive a tight worst-case error bound for the heuristic presented by Lee and Mirchandani, and propose another heuristic with a tight worst-case error bound of 3/2.
URI: http://hdl.handle.net/10397/16547
ISSN: 1042-296X
DOI: 10.1109/70.744613
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

7
Last Week
0
Last month
0
Citations as of Sep 11, 2017

WEB OF SCIENCETM
Citations

5
Last Week
0
Last month
0
Citations as of Sep 6, 2017

Page view(s)

40
Last Week
2
Last month
Checked on Sep 24, 2017

Google ScholarTM

Check

Altmetric



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