期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 88, 期 -, 页码 317-325出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2015.07.018
关键词
Scheduling; Two-stage assembly; Setup times; Common components
This paper considers a two-stage assembly scheduling problem of N products with setup times to minimize the makespan. In this problem, there is a machining machine which produces components in the first stage. When the required components are available, a single assembly machine can assemble these components into products in the second stage. A setup time is needed whenever the machining machine starts processing components, or the item of component is switched on the machine. The problem is formulated as a mixed integer programming model, and several properties for finding optimal solutions are developed. Moreover, an efficient heuristic based on these optimal properties is proposed. A lower bound is derived to evaluate the performance of the proposed heuristic. Computational results show that the proposed heuristic can obtain a near optimal solution in almost zero time and the average percentage deviation is only 0.478. (C) 2015 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据