Two metaheuristic methods for the common cycle economic lot sizing and scheduling in flexible flow shops with limited intermediate buffers: The finite horizon case
Two metaheuristic methods for the common cycle economic lot sizing and scheduling in flexible flow shops with limited intermediate buffers: The finite horizon case
复制标题
具有有限中间缓冲区的灵活流水车间中常见循环经济批量大小和调度的两种元启发式方法：有限水平情况
DOI：
10.1016/j.amc.2006.05.106
复制
发表时间：
2006
期刊：
影响因子：
--
通讯作者：
S. H. M. Husseini
中科院分区：
文献类型：
--
作者：
B. Akrami;B. Karimi;S. H. M. Husseini
研究了确定性柔性流水车间中的共同周期多产品批量与调度问题，其中计划期是有限的，由管理层确定，生产阶段是串联的，中间缓冲区是有限的。阶段之间有限的中间缓冲区导致阻塞调度问题，其中已完成的部件可能保留在机器上并阻塞它，直到下游机器可用。这将防止在被阻塞的机器上处理另一个零件。我们提出了一个新的混合整数非线性规划，由于难以获得最优解的中型和大型的问题，我们使用遗传算法和禁忌搜索方法来找到一个最优或接近最优的解决方案的问题。在随机生成问题上，将这两种方法与最优枚举法进行了比较。计算结果表明，遗传算法和TS的性能是非常有前途的。
This paper addresses the common cycle multi-product lot sizing and scheduling problem in deterministic flexible flow shops where the planning horizon is finite and fixed by management and the production stages are in series, while separated by finite intermediate buffers. The limited intermediate buffers between the stages result in a blocking scheduling problem, where a completed part may remain on a machine and block it until a downstream machine becomes available. This prevents another part from being processed on the blocked machine. We propose a new mixed integer nonlinear program and due to difficulty of obtaining the optimal solution in medium and large-scaled problems, we use both genetic algorithm and tabu search methods to find an optimal or near-optimal solution for the problem. The two proposed solution methods are compared with optimal enumeration method (OEM) on randomly generated problems. Computational results show that the performance of both GA and TS are very promising.