A genetic algorithm for simultaneous lotsizing and sequencing of the permutation flow shops with sequence-dependent setups
A genetic algorithm for simultaneous lotsizing and sequencing of the permutation flow shops with sequence-dependent setups
复制标题
DOI：
10.1080/0951192x.2010.511654
复制
发表时间：
2011-01
影响因子：
4.1
通讯作者：
M. Mohammadi;S. Ghomi;Niloofar Jafari
中科院分区：
文献类型：
--
作者：
M. Mohammadi;S. Ghomi;Niloofar Jafari
本文提出了一种遗传算法（GA）的置换流水车间的同时批量和排序问题，涉及序列相关的设置和能力的限制。为了评估所提出的遗传算法的有效性，两个下界的开发和比较对最优解。GA的结果进行了比较与选定的下限。
This article proposes a genetic algorithm (GA) for the simultaneous lotsizing and sequencing problem in permutation flow shops involving sequence-dependent setups and capacity constraints. To evaluate the effectiveness of the proposed GA, two lower bounds are developed and compared against the optimal solution. The results of GA are compared with the selected lower bound.