Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1227
PIRA download icon_1.1View/Download Full Text
Title: Scheduling in an assembly-type production chain with batch transfer
Authors: Lin, BMT
Cheng, TCE 
Chou, ASC
Issue Date: Apr-2007
Source: Omega, Apr. 2007, v.35, no. 2, p. 143-151
Abstract: This paper addresses a three-machine assembly-type flowshop scheduling problem, which frequently arises from manufacturing process management as well as from supply chain management. Machines one and two are arranged in parallel for producing component parts individually, and machine three is an assembly line arranged as the second stage of a flowshop for processing the component parts in batches. Whenever a batch is formed on the second-stage machine, a constant setup time is required. The objective is to minimize the makespan. In this study we establish the strong NP-hardness of the problem for the case where all the jobs have the same processing time on the second-stage machine. We then explore a useful property, based upon which a special case can be optimally solved in polynomial time. We also study several heuristic algorithms to generate quality approximate solutions for the general problem. Computational experiments are conducted to evaluate the effectiveness of the algorithms.
Keywords: Two-stage flowshop
Batch scheduling
Makespan
NP-hardness
Heuristics
Publisher: Pergamon Press
Journal: Omega 
ISSN: 0305-0483
EISSN: 1873-5274
DOI: 10.1016/j.omega.2005.04.004
Rights: Omega © 2005 Elsevier Ltd. The journal web site is located at http://www.sciencedirect.com.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
LIN_CHENG_CHOU_0327_LIB.pdfPre-published version239.1 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page views

144
Last Week
0
Last month
Citations as of Mar 24, 2024

Downloads

197
Citations as of Mar 24, 2024

SCOPUSTM   
Citations

35
Last Week
0
Last month
0
Citations as of Mar 28, 2024

WEB OF SCIENCETM
Citations

33
Last Week
0
Last month
0
Citations as of Mar 28, 2024

Google ScholarTM

Check

Altmetric


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