An Improved Hybrid Model for the Generic Hoist Scheduling Problem

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/10609/10021

dc.contributor.author	Riera Terrén, Daniel
dc.contributor.author	Yorke-Smith, Neil
dc.date	2011-11-24T14:34:27Z
dc.date	2011-11-24T14:34:27Z
dc.date	2002
dc.identifier.citation	Annals of Operations Research, 2002, vol. 115, pàgs. 173-191.
dc.identifier.citation	DOI: 10.1023/A:1021101321339
dc.identifier.uri	http://hdl.handle.net/10609/10021
dc.language.iso	eng
dc.publisher	SpringerLink
dc.relation	Annals of Operations Research:115
dc.rights	http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject	hoist scheduling
dc.subject	modelling
dc.subject	hybrid methods
dc.subject	benchmarks
dc.subject	modelatge
dc.subject	mètodes híbrids
dc.subject	benchmarks
dc.subject	modelado
dc.subject	métodos híbridos
dc.subject	benchmarks
dc.title	An Improved Hybrid Model for the Generic Hoist Scheduling Problem
dc.type	info:eu-repo/semantics/article
dc.description.abstract	Peer-reviewed
dc.description.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 uni¯ed 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.