期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 47, 期 1, 页码 91-101出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2004.03.002
关键词
hoist scheduling; constraint satisfaction problem; backtracking; heuristics
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. (C) 2004 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据