Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/9546
Title: Fabrication and assembly scheduling in a two-machine flowshop
Authors: Lin, BMT
Cheng, TCE 
Issue Date: 2002
Publisher: Taylor & Francis
Source: IIE transactions, 2002, v. 34, no. 11, p. 1015-1020 How to cite?
Journal: IIE transactions 
Abstract: This paper considers a fabrication scheduling problem to minimize the makespan in a two-machine flowshop. Each job has a unique component and a common component to be processed on the first machine. On machine 1, the common components of the jobs are grouped into batches for processing with a setup cost incurred whenever a batch is formed. A job is ready for its assembly operation on the second machine if both its unique and common components are finished on machine 1. The problems with batch availability and item availability are known as NP-hard. In this paper, we give proofs for the strong NP-hardness of the two problems. The results suggest that it is very unlikely to develop polynomial- or pseudo-polynomial-time algorithm for finding exact solutions for the two problems.
URI: http://hdl.handle.net/10397/9546
ISSN: 0740-817X
EISSN: 1545-8830
DOI: 10.1023/A:1016190815843
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

21
Last Week
0
Last month
0
Citations as of Nov 24, 2018

WEB OF SCIENCETM
Citations

13
Last Week
0
Last month
0
Citations as of Dec 8, 2018

Page view(s)

88
Last Week
0
Last month
Citations as of Dec 3, 2018

Google ScholarTM

Check

Altmetric


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