A constraint propagation heuristic for the single-hoist, multiple-products scheduling problem
A constraint propagation heuristic for the single-hoist, multiple-products scheduling problem
复制标题
DOI：
10.1016/j.cie.2004.03.002
复制
发表时间：
2004-08
期刊：
影响因子：
--
通讯作者：
K. Hindi;Krzysztof Fleszar
中科院分区：
文献类型：
--
作者：
K. Hindi;Krzysztof Fleszar
提出了一种求解单提升机多产品调度问题的启发式算法。该算法采用非标准的约束满足问题模型，并采用变量排序、前向检查和回溯。计算结果，包括与现有算法的解决方案的质量和速度方面的比较。
A heuristic algorithm for solving the single-hoist, multiple-product scheduling problem is presented. The algorithm uses a non-standard Constraint Satisfaction Problem model and employs variable ordering, forward checking and backtracking. Computational results, including comparison with existing algorithms in terms of solution quality and speed, are presented.