Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/22854
Title: A note on scheduling alternative operations in two-machine flowshops
Authors: Cheng, TCE 
Wang, G
Keywords: Alternative operations
Dynamic programming algorithm
Flowshop scheduling
Issue Date: 1998
Publisher: Palgrave Macmillan
Source: Journal of the Operational Research Society, 1998, v. 49, no. 6, p. 670-673 How to cite?
Journal: Journal of the Operational Research Society 
Abstract: In this note, we consider a class of problems for scheduling a set of jobs each of which consists of two consecutive operations. The jobs are to be processed in a two-machine flowshop in which either or both machines are versatile. A versatile machine can perform both operations of a job. The objective is to minimise the makespan. While the whole class of problems has been shown to be NP-complete, we provide a general pseudopolynomial dynamic programming scheme which solves the problems analytically. This also establishes that the problems are only NP-complete in the ordinary sense. The solution scheme can be modified to solve another class of similar two-machine flowshop scheduling problems.
URI: http://hdl.handle.net/10397/22854
ISSN: 0160-5682
EISSN: 1476-9360
DOI: 10.1057/palgrave.jors.2600575
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

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

WEB OF SCIENCETM
Citations

4
Last Week
0
Last month
0
Citations as of Sep 14, 2017

Page view(s)

42
Last Week
1
Last month
Checked on Sep 17, 2017

Google ScholarTM

Check

Altmetric



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