标题: | Scheduling in an assembly-type production chain with batch transfer |
作者: | Lin, B. M. T. Cheng, T. C. E. Chou, A. S. C. 资讯管理与财务金融系 注:原资管所+财金所 Department of Information Management and Finance |
关键字: | two-stage flowshop;batch scheduling;makespan;NP-hardness;heuristics |
公开日期: | 1-四月-2007 |
摘要: | 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 |
期刊: | OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE |
Volume: | 35 |
Issue: | 2 |
起始页: | 143 |
结束页: | 151 |
显示于类别: | Articles |
文件中的档案:
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.