Title: Scheduling in an assembly-type production chain with batch transfer
Authors: Lin, B. M. T.
Cheng, T. C. E.
Chou, A. S. C.
資訊管理與財務金融系 註:原資管所+財金所
Department of Information Management and Finance
Keywords: two-stage flowshop;batch scheduling;makespan;NP-hardness;heuristics
Issue Date: 1-Apr-2007
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. (c) 2005 Elsevier Ltd. All rights reserved.
URI: http://dx.doi.org/10.1016/j.omega.2005.04.004
http://hdl.handle.net/11536/10968
ISSN: 0305-0483
DOI: 10.1016/j.omega.2005.04.004
Journal: OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
Volume: 35
Issue: 2
Begin Page: 143
End Page: 151
Appears in Collections:Articles


Files in This Item:

  1. 000241089300002.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.