Schedules for a two-stage hybrid flowshop with parallel machines at the second stage
Schedules for a two-stage hybrid flowshop with parallel machines at the second stage
复制标题
DOI：
10.1080/00207549108948025
复制
发表时间：
1991-07
影响因子：
9.2
通讯作者：
J. Gupta;E. Tunc
中科院分区：
文献类型：
--
作者：
J. Gupta;E. Tunc
当第二阶段由多台相同的机器组成时，提出了两阶段混合流水车间最小完工时间调度的近似求解算法。计算经验比较“近似”的最大完工时间与其各自的全球下界的大型问题表明，提出的多项式有界近似算法是非常有效的。结果表明，所提出的启发式算法可以用来提高现有的分支定界算法的效率。
Approximate solution algorithms are developed to find a minimum makespan schedule in a two-stage hybrid flowshop when the second stage consists of multiple identical machines. Computational experience comparing the ‘approximate’ makespans with their respective global lower bounds for large problems indicates that proposed polynomially bounded approximate algorithms are quite effective. It is shown that the proposed heuristic algorithms can be used to improve the efficiency of an existing branch and bound algorithm.