Institutional Repository
Institutional Repository Institutional Repository Login  Institutional Repository  
  • UOC Library |
  •  |
  •  |

Home >
Research >
Techonology and Communication >
Computer Science, Technology and Multimedia >
Articles >

Please use this identifier to cite or link to this item:
Title: An Improved Hybrid Model for the Generic Hoist Scheduling Problem
Authors: Riera Terrén, Daniel
Yorke-Smith, Neil
Keywords: hoist scheduling
hybrid methods
Issue Date: 2002
Publisher: SpringerLink
Type: Article
Citation: Annals of Operations Research, 2002, vol. 115, pàgs. 173-191.
Series/Report no.: Annals of Operations Research:115
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.
Description: Peer-reviewed
Language: eng
Appears in Collections:Articles

Add This:


  0 (0 valuations)

Files in This Item:

File Description SizeFormat
Riera_AOR2002AnImproved.pdfPreprint209.9 kBAdobe PDFPreview  Download

Author names in Twitter

Author names in FriendFeed

Recommend this item

SFX Query

This item is licensed under a Creative Commons License
Creative Commons

Items in Repository e are protected by copyright, with all rights reserved, unless otherwise indicated.


The library replies
A product of the Universitat Oberta de Catalunya Virtual Library
Legal notice | Cookie policy