An Improved Hybrid Model for the Generic Hoist Scheduling Problem

Daniel Riera () and Neil Yorke-Smith ()

Annals of Operations Research, 2002, vol. 115, issue 1, 173-191

Abstract: The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a unified model has been developed with the problem description and solution method separated. We provide an improved model and new preprocessing stages where, as before, solutions and proof of optimality are provided by a hybrid CLP–MIP algorithm. The new algorithm is more scalable and robust. We give empirical results for a range of problem classes on benchmark problems from several sources. Copyright Kluwer Academic Publishers 2002

Keywords: hoist scheduling; hybrid methods; modelling; benchmarks (search for similar items in EconPapers)
Date: 2002
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1021101321339 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:115:y:2002:i:1:p:173-191:10.1023/a:1021101321339

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1021101321339

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().