Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions
Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions
复制标题
在截止日期限制下最大限度地减少分批进料过程中与顺序相关的设置成本
DOI：
10.1007/s10951-013-0334-0
复制
发表时间：
2013
影响因子：
2
通讯作者：
Klamroth
中科院分区：
文献类型：
--
作者：
Klamroth
本文解决了在进料批量过程中序列相关设置成本的最小化问题。由于进料批处理过程通常为随后的时间关键阶段提供模块，因此必须满足硬截止日期限制。通常，进料批处理过程具有与产生的机器状态差异成比例的特定设置成本结构。如果每个作业都有不同的批处理类型，那么硬截止日期的集成将导致一个问题，该问题相当于具有一般处理时间和截止日期的Line-TSPTW的特定变体。我们证明了这个众所周知的问题是二进制困难的，但其复杂性长期以来一直未知。虽然已知具有恒定批类型数的更相关的版本是强多项式的，但在文献中没有找到实际适用的精确解方法。因此，本文提出了新的求解算法。具体地说，发展了动态规划和分支定界方法。通过使用修改后的问题定义、新的枚举方案和专门设计的优势规则，即使具有多达200个作业的复杂问题实例也可以通过新的最佳优先分支边界算法得到最优解决。除了详细的复杂性分析外，还通过计算实验验证了所提方法的有效性。
This paper addresses the minimization of sequence-dependent setup costs in feeding batch processes. Since feeding batch processes often supply subsequent time-critical stages with modules, hard due date restrictions have to be met. It is common that feeding batch processes possess a specific structure of setup costs that are proportional to resulting machine state differences. If each job has a different batch type, the integration of hard due dates leads to a problem that is equivalent to a specific variant of the Line-TSPTW with general processing times and deadlines. We show that this well-known problem, whose complexity status has been unknown for a long time, is binary-hard. Although the more relevant version with a constant number of batch types is known to be strongly polynomial, no practically applicable exact solution method can be found in the literature. Therefore, this paper proposes new solution algorithms. Specifically, Dynamic Programming and Branch&Bound approaches are developed. By making use of a modified problem definition, a new enumeration scheme, and a specifically designed dominance rule, even complex problem instances with up to 200 jobs are optimally solved by a new best-first Branch&Bound algorithm. Apart from a detailed complexity analysis, the efficiency of the proposed approaches is validated by computational experiments.
DOI：
--
发表时间：
2007
期刊：
影响因子：
--
作者：
M. Lahmar;S. Benjaafar
通讯作者：
S. Benjaafar
在自动化装配线上搜索最佳重新排序和特征分配
DOI：
--
发表时间：
2005
期刊：
IEEE International Conference on Tools with Artificial Intelligence
影响因子：
--
作者：
A. Lim;Zhou Xu
通讯作者：
Zhou Xu
喷漆车间、奇怪的周期和项链分裂
影响因子：
1.1
作者：
Frédéric Meunier;András Sebö
通讯作者：
András Sebö