Anzeige
Erschienen in:
2005 | OriginalPaper | Buchkapitel
Hybrid MIP-CP Techniques to Solve a Multi-Machine Assignment and Scheduling Problem in Xpress-CP
verfasst von : Alkis Vazacopoulos, Nitin Verma
Erschienen in: Supply Chain Optimization
Verlag: Springer US
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In this paper we introduce Xpress-CP—a Constraint Programming tool-and demonstrate its modeling and solving capabilities. We consider the multi-machine assignment and scheduling problem (Hooker et al. (1999)), where jobs, with release dates and deadlines, have to be processed on parallel unrelated machines (where processing times depend on machine assignment). Given a job/machine assignment cost matrix, the objective is to minimize the total cost while keeping all machine schedules feasible. We show that by deriving the benefits of MIP and CP techniques simultaneously this problem can be modeled and solved efficiently in a hybrid fashion using Xpress Optimization suite.