Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Philippe Laborie"'
Publikováno v:
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
Universidade de São Paulo (USP)
instacron:USP
In this work, the online printing shop scheduling problem is considered. This challenging real problem, that appears in the nowadays printing industry, can be seen as a flexible job shop scheduling problem with sequence flexibility in which precedenc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::88664b1c2a133eefcb949e994ee5e910
http://arxiv.org/abs/2006.13064
http://arxiv.org/abs/2006.13064
Publikováno v:
Constraints. 23:210-250
IBM ILOG CP Optimizer is a generic CP-based system to model and solve scheduling problems. It provides an algebraic language with simple mathematical concepts to capture the temporal dimension of scheduling problems in a combinatorial optimization fr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1c76a5b6b86f53812aeb3e9378e968a4
https://doi.org/10.1007/s10601-018-9281-x
https://doi.org/10.1007/s10601-018-9281-x
Autor:
Philippe Laborie
Publikováno v:
Integration of Constraint Programming, Artificial Intelligence, and Operations Research ISBN: 9783319930305
CPAIOR
CPAIOR
This paper presents the concept of objective landscape in the context of Constraint Programming. An objective landscape is a light-weight structure providing some information on the relation between decision variables and objective values, that can b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6ed25a666308cd0cf4faa119a1c819bc
https://doi.org/10.1007/978-3-319-93031-2_28
https://doi.org/10.1007/978-3-319-93031-2_28
Autor:
Philippe Laborie
Publikováno v:
Integration of Constraint Programming, Artificial Intelligence, and Operations Research ISBN: 9783319930305
CPAIOR
CPAIOR
We consider a well known resource allocation and scheduling problem for which different approaches like mixed-integer programming (MIP), constraint programming (CP), constraint integer programming (CIP), logic-based Benders decompositions (LBBD) and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3cd0a1346fbe48a362b1f428678f190f
https://doi.org/10.1007/978-3-319-93031-2_29
https://doi.org/10.1007/978-3-319-93031-2_29
Autor:
Philippe Laborie, Jérôme Rogerie
Publikováno v:
Journal of Scheduling. 19:391-400
IBM ILOG CP Optimizer is a constraint solver that implements a model-and-run paradigm. For scheduling problems, CP Optimizer provides a relatively simple but very expressive modeling language based on the notion of interval variables. This paper pres
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cdc59cfe8c8fbf18147fc8c777bb0dcb
https://doi.org/10.1007/s10951-014-0408-7
https://doi.org/10.1007/s10951-014-0408-7
Publikováno v:
Journal of Scheduling. 12:315-344
There are many systems and techniques that address stochastic planning and scheduling problems, based on distinct and sometimes opposite approaches, especially in terms of how generation and execution of the plan, or the schedule, are combined, and i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8c0101b7696357abe7c58bb5401e6d5c
https://doi.org/10.1007/s10951-008-0080-x
https://doi.org/10.1007/s10951-008-0080-x
Publikováno v:
12th International Conference on Integration of AI and OR Techniques in Constraint Programming (CPAIOR 2015)
12th International Conference on Integration of AI and OR Techniques in Constraint Programming (CPAIOR 2015), May 2015, Barcelone, Spain. pp.1-17, ⟨10.1007/978-3-319-18008-3_1⟩
Integration of AI and OR Techniques in Constraint Programming ISBN: 9783319180076
CPAIOR
12th International Conference on Integration of AI and OR Techniques in Constraint Programming (CPAIOR 2015), May 2015, Barcelone, Spain. pp.1-17, ⟨10.1007/978-3-319-18008-3_1⟩
Integration of AI and OR Techniques in Constraint Programming ISBN: 9783319180076
CPAIOR
International audience; The Time-Dependent Traveling Salesman Problem (TDTSP) is the extended version of the TSP where arc costs depend on the time when the arc is traveled. When we consider urban deliveries, travel times vary considerably during the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7a9ce0fc4af98ebe8d58e433c8265faa
https://hal.archives-ouvertes.fr/hal-01163394/document
https://hal.archives-ouvertes.fr/hal-01163394/document
Publikováno v:
IFAC Proceedings Volumes. 39:615-620
The problem we tackle is progressive scheduling with temporal and resource uncertainty. Operation durations are imprecise and alternative resources may break down. Operation end times and resource breakdowns are observed during execution. In this pap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::019c2da7fb239681d2213d12b56bc8bc
https://doi.org/10.3182/20060517-3-fr-2903.00313
https://doi.org/10.3182/20060517-3-fr-2903.00313
Autor:
Philippe Laborie
Publikováno v:
Artificial Intelligence. 143:151-188
This paper summarizes the main existing approaches to propagate resource constraints in Constraint-Based scheduling and identifies some of their limitations for using them in an integrated planning and scheduling framework. We then describe two new a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::97aa0dbefdfc9abda7e5bc6cdd8854b7
https://doi.org/10.1016/s0004-3702(02)00362-4
https://doi.org/10.1016/s0004-3702(02)00362-4