An Improved Hybrid Model for the Generic Hoist Scheduling Problem

Riera Terrén, Daniel; Yorke-Smith, Neil

Please use this identifier to cite or link to this item: http://hdl.handle.net/10609/10021

Full metadata record

DC Field	Value	Language
dc.contributor.author	Riera Terrén, Daniel	-
dc.contributor.author	Yorke-Smith, Neil	-
dc.date.accessioned	2011-11-24T14:34:27Z	-
dc.date.available	2011-11-24T14:34:27Z	-
dc.date.issued	2002	-
dc.identifier.citation	Annals of Operations Research, 2002, vol. 115, pàgs. 173-191.	-
dc.identifier.uri	http://hdl.handle.net/10609/10021	-
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.	en
dc.format.mimetype	application/pdf	-
dc.language.iso	eng	-
dc.publisher	SpringerLink	-
dc.relation.ispartofseries	Annals of Operations Research:115	-
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/es/	-
dc.subject	hoist scheduling	en
dc.subject	modelling	en
dc.subject	hybrid methods	en
dc.subject	benchmarks	en
dc.subject	modelatge	ca
dc.subject	modelado	es
dc.subject	mètodes híbrids	ca
dc.subject	métodos híbridos	es
dc.subject	benchmarks	ca
dc.subject	benchmarks	es
dc.title	An Improved Hybrid Model for the Generic Hoist Scheduling Problem	-
dc.type	info:eu-repo/semantics/article	-
dc.audience.mediator	Theme areas::Computer Science, Technology and Multimedia	en
dc.identifier.doi	10.1023/A:1021101321339	-
dc.gir.id	AR/0000000164	-
Appears in Collections:	Articles cientÍfics Articles