Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/15331
Title: Scheduling the fabrication and assembly of components in a two-machine flowshop
Authors: Cheng, TCE 
Wang, G
Issue Date: 1999
Publisher: Taylor & Francis
Source: IIE transactions, 1999, v. 31, no. 2, p. 135-143 How to cite?
Journal: IIE transactions 
Abstract: In this paper we study the problem of scheduling the fabrication and assembly of components in a two-machine flowshop so as to minimize the makespan. Each job consists of a component unique to that job and a component common to all jobs. Both the unique and the common components are processed on the first machine. While the unique components are processed individually, the common components are processed in batches and a setup is needed to form each batch. The assembly operations of a job is performed on the second machine, and can only begin when both components for the job are available. We first show that the problem is NP-complete with either batch availability or item availability for the common components. We identify several properties of an optimal solution to the problem, and some polynomially solvable special cases.
URI: http://hdl.handle.net/10397/15331
ISSN: 0740-817X
EISSN: 1545-8830
DOI: 10.1023/A:1007512501565
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

37
Last Week
0
Last month
0
Citations as of Aug 10, 2017

WEB OF SCIENCETM
Citations

29
Last Week
0
Last month
0
Citations as of Aug 13, 2017

Page view(s)

49
Last Week
2
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



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