A constraint propagation heuristic for the single-hoist, multiple-products scheduling problem

被引：24

作者：

Hindi, KS

Fleszar, K

机构：

[1] Amer Univ Beirut, Fac Engn & Architecture, Beirut 2020, Lebanon

[2] Amer Univ Beirut, Sch Business, Beirut 2020, Lebanon

[3] Warsaw Univ Technol, Inst Control & Computat Engn, PL-00665 Warsaw, Poland

来源：

COMPUTERS & INDUSTRIAL ENGINEERING | 2004年 / 47卷 / 01期

关键词：

hoist scheduling; constraint satisfaction problem; backtracking; heuristics;

D O I：

10.1016/j.cie.2004.03.002

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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.

引用

页码：91 / 101

页数：11

共 12 条

[1] TOWARDS A GENERAL-THEORY OF ACTION AND TIME [J].