1 An Evaluation of Sequencing Heuristics for Flexible Flowshop Scheduling Problems with Unrelated Parallel Machines and Dual Criteria
1 An Evaluation of Sequencing Heuristics for Flexible Flowshop Scheduling Problems with Unrelated Parallel Machines and Dual Criteria
复制标题
1 具有不相关并行机和双重标准的灵活流水作业调度问题的排序启发式评估
DOI：
--
复制
发表时间：
2005
期刊：
影响因子：
--
通讯作者：
Frank Werner
中科院分区：
文献类型：
--
作者：
Jitti Jungwattanakit;Manop Reodecha;P. Chaovalitwongse;Frank Werner
本文研究了具有不相关平行机的柔性流水车间调度问题的启发式解法。在开始处理作业之前，设置时间是必要的，其中设置时间取决于前一个作业。不允许抢占工作。本文以最小化完工时间与误工工件数的正加权凸和为目标函数。本文将Palmer（1965）、坎贝尔、Dudek和Smith（1970）、Gupta（1971）和Dannenbring（1977）给出的算法以及Nawaz、Enscore和Ham（1983）给出的插入启发式算法等一些著名的构造性启发式算法推广到柔性Flowshop环境中。通过使用这些算法之一来生成第一阶段序列。然后，将使用此序列，结合FIFO或置换规则，为整个问题构建一个时间表。最后的解决方案是由两个规则之一获得的最佳时间表。此外，一些迭代算法，如遗传算法和模拟退火方法，提出了提高质量的建设性的解决方案。详细的计算结果来评估的启发式算法的效率。给出了该算法的详细计算结果。© 2005 Elseviser B。版权所有© 2016
This paper deals with the heuristic solution of flexible flowshop scheduling problems with unrelated parallel machines. A setup time is necessary before starting the processing of a job, where the setup time depends on the previous job. No preemption of jobs is allowed. As objective function, this paper considers the minimization of the positively weighted convex sum of makespan and the number of tardy jobs. This paper develops some well-known constructive heuristics for the pure flowshop scheduling problems such as the algorithms given by Palmer (1965), Campbell, Dudek, and Smith (1970), Gupta (1971), and Dannenbring (1977) as well as the insertion heuristic by Nawaz, Enscore and Ham (1983) to the flexible flowshop environment. By using one of these heuristics, the first stage sequence is generated. This sequence will then be used, in conjunction with either FIFO or permutation rules, to construct a schedule for the overall problem. The final solution is then the best schedule obtained by one of the two rules. Furthermore, some iterative heuristics such as a genetic algorithm and a simulated annealing approach are proposed to increase the quality of the constructive solution. Detailed computational results are presented to evaluate the efficiency of the heuristic algorithms. Detailed computational results with the algorithms are presented. © 2005 Elseviser B. V. All rights reserved.