Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/12124
Title: Two- and three-stage flowshop scheduling with no-wait in process
Authors: Cheng, TCE 
Sriskandarajah, C
Wang, G
Keywords: Algorithms
Complexity
Flowshop scheduling
Makespan minimization
Issue Date: 2000
Publisher: Wiley-Blackwell
Source: Production and operations management, 2000, v. 9, no. 4, p. 367-378 How to cite?
Journal: Production and operations management 
Abstract: In this paper we study the time complexities of some two- and three-stage no-wait flowshop makespan scheduling problems where, in some stage, all the jobs require a constant processing time and the stage may consist of parallel identical machines. Polynomial time algorithms are presented for certain problems, while several others are proved to be strongly NP-complete.
URI: http://hdl.handle.net/10397/12124
ISSN: 1059-1478
EISSN: 1937-5956
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

6
Citations as of Jul 7, 2017

WEB OF SCIENCETM
Citations

6
Last Week
1
Last month
0
Citations as of Aug 15, 2017

Page view(s)

88
Last Week
1
Last month
Checked on Aug 14, 2017

Google ScholarTM

Check



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