Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

ANOR
2002

favoriteEmaildiscussreport

67views more ANOR 2002»

An Improved Hybrid Model for the Generic Hoist Scheduling Problem

13 years 4 months ago

An Improved Hybrid Model for the Generic Hoist Scheduling Problem

Download www.ai.sri.com

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

Daniel Riera, Neil Yorke-Smith

Real-time Traffic

ANOR 2002 | Generic Hoist | Hybrid Clpmip Algorithm | Problem Description |

claim paper

Related Content

» Optimization of Group Elevator Scheduling With Advance Information

» An estimation of distribution algorithm with guided mutation for a complex flow shop sched...

» A fast and generic hybrid simulation approach using C virtual machine

» A Constraint Integer Programming Approach for ResourceConstrained Project Scheduling

» A hybrid approach to protein folding problem integrating constraint programming with local...

» Hybrid Set Domains to Strengthen Constraint Propagation and Reduce Symmetries

» Novel local features with hybrid sampling technique for image retrieval

» Link Scheduling with QoS Guarantee for Wireless Relay Networks

» Repairing MIP infeasibility through local branching

Post Info
More Details (n/a)

Added	16 Dec 2010
Updated	16 Dec 2010
Type	Journal
Year	2002
Where	ANOR
Authors	Daniel Riera, Neil Yorke-Smith

Comments (0)