Result: A hybrid method for planning and scheduling
Title:
A hybrid method for planning and scheduling
Authors:
Source:
Principles and practice of constraint programming (CP 2004)Constraints (Dordrecht). 10(4):385-401
Publisher Information:
Heidelberg: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 18 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Programmation mathématique, Mathematical programming, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Ordonnancement, Scheduling, Reglamento, Parallélisme, Parallelism, Paralelismo, Planification, Planning, Planificación, Programmation linéaire, Linear programming, Programación lineal, Programmation logique avec contrainte, Constraint logic programming, Programación lógica con restricción, Programmation partiellement en nombres entiers, Mixed integer programming, Programación mixta entera, Temps total achèvement, Makespan, Tiempo total acabamiento, Contrainte ressource, Resource constraint, Constreñimiento recurso, Décomposition Bender, Méthode hybride, Bender's decomposition, hybrid methods, planning and scheduling
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Tepper School of Business, Carnegie Mollon University, Pittsburgh, United States
ISSN:
1383-7133
Rights:
Copyright 2006 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Operational research. Management
Operational research. Management
Accession Number:
edscal.17266048
Database:
PASCAL Archive
Further Information
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and scheduled using CP, and the two are linked via logic-based Benders decomposition. Tasks assigned to a facility may run in parallel subject to resource constraints (cumulative scheduling). We solve minimum cost problems, as well as minimum makespan problems in which all tasks have the same release date and deadline. We obtain computational speedups of several orders of magnitude relative to the state of the art in both MILP and CP.