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

  • Authors:

  • Khalil S. Hindi;Krzysztof Fleszar

  • Affiliations:

  • Faculty of Engineering and Architecture and the School of Business, American University of Beirut (AUB), P.O. Box 11-0236, Riad El Solh, Beirut 1107 2020, Lebanon;Institute of Control & Computation Engineering, Warsaw University of Technology, ul. Nowowiejska 15/19, 00-665 Warszawa, Poland

  • Venue:
  • Computers and Industrial Engineering
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.