Heuristics for hybrid flow shops with controllable processing times and assignable due dates
Heuristics for hybrid flow shops with controllable processing times and assignable due dates
复制标题
DOI：
10.1016/s0305-0548(01)00040-5
复制
发表时间：
2002-09-01
影响因子：
4.6
通讯作者：
Sotskov, YN
中科院分区：
文献类型：
--
作者：
Gupta, JND;Krüger, K;Sotskov, YN
本文考虑了一个广义的置换流水车间问题，结合调度功能的规划阶段。在这个问题上。每个工作中心由平行的相同机器组成。每个作业都有不同的发布日期，并且由必须在不同加工中心的机器上以相同顺序处理的有序操作组成。此外，某些机器上的操作的处理时间可能在最小值和最大值之间变化，这取决于连续可分资源的使用。我们考虑一个非正规的优化准则的基础上，这是不是一个先验给定的，但可以固定的决策者的到期日。一个到期日分配成本包括到目标函数。对于这种类型的问题，我们概括了著名的经典问题的启发式解决方案的方法，并提出了建设性的算法，基于工作插入技术和迭代算法的基础上局部搜索。对于后者，我们处理的设计适当的社区，以找到更好的质量解决方案。最多20个工作和10个加工中心的问题的计算结果。
This paper considers a generalization of the permutation flow shop problem that combines the scheduling function with the planning stage. In this problem. each work center consists of parallel identical machines. Each job has a different release date and consists of ordered operations that have to be processed on machines from different machine centers in the same order. In addition, the processing times of the operations on some machines may vary between a minimum and a maximum value depending on the use of a continuously divisible resource. We consider a nonregular optimization criterion based on due dates which are not a priori given but can be fixed by a decision-maker. A due date assignment cost is included into the objective function. For this type of problems, we generalize well-known approaches for the heuristic solution of classical problems and propose constructive algorithms based on job insertion techniques and iterative algorithms based on local search. For the latter, we deal with the design of appropriate neighborhoods to find better quality solution. Computational results for problems with up to 20 jobs and 10 machine centers are given.