Please use this identifier to cite or link to this item:
|Title:||Scheduling in an assembly-type production chain with batch transfer|
|Authors:||Lin, B. M. T.|
Cheng, T. C. Edwin
Chou, A. S. C.
|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.|
|Rights:||Omega © 2005 Elsevier Ltd. The journal web site is located at http://www.sciencedirect.com.|
|Appears in Collections:||LMS Journal/Magazine Articles|
Files in This Item:
|LIN_CHENG_CHOU_0327_LIB.pdf||Pre-published version||239.1 kB||Adobe PDF||View/Open|
All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated. No item in the PolyU IR may be reproduced for commercial or resale purposes.