期刊
JOURNAL OF MANUFACTURING SYSTEMS
卷 32, 期 1, 页码 167-173出版社
ELSEVIER SCI LTD
DOI: 10.1016/j.jmsy.2012.08.001
关键词
Scheduling; Non-permutation flow shop; Learning effects; Availability constraints; Heuristic method
The flow shop scheduling problem is an attractive subject in the field of scheduling, which has attracted the attention of many researchers in the past five decades. In this paper, the non-permutation flow shop scheduling problem with the learning effects and machine availability constraints has been studied for minimizing the total flow time as a performance measure. First, a mixed integer linear programming model has been proposed for the modeling of the problem and then, an effective improving heuristic method, which is able to find proper non-permutation solutions, has been presented. Finally, the computational results are used for evaluation the performance and effectiveness of the proposed heuristic. (C) 2012 The Society of Manufacturing Engineers. Published by Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据