Philippe Baptiste

Publication Activity (10 Years)

Years Active: 1995-2018
Publications (10 Years): 2

Top Topics

Prune The Search Space

Global Constraints

Top Venues

Discret. Appl. Math.

Publications

Philippe Baptiste, Nicolas Bonifas
Redundant cumulative constraints to compute preemptive bounds. Discret. Appl. Math. 234 (2018)
Philippe Baptiste, Mikhail Y. Kovalyov, Yury L. Orlovich, Frank Werner, Igor E. Zverovich
Graphs with maximal induced matchings of the same size. Discret. Appl. Math. 216 (2017)
Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko
Integer preemptive scheduling on parallel machines. Oper. Res. Lett. 40 (6) (2012)
Philippe Baptiste, Marek Chrobak, Christoph Dürr
Polynomial-time algorithms for minimum energy scheduling. ACM Trans. Algorithms 8 (3) (2012)
Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko
Properties of optimal schedules in preemptive shop scheduling. Discret. Appl. Math. 159 (5) (2011)
Philippe Baptiste
A note on scheduling identical coupled tasks in logarithmic time. Discret. Appl. Math. 158 (5) (2010)
Giacomo Nannicini, Philippe Baptiste, Gilles Barbier, Daniel Krob, Leo Liberti
Fast paths in large-scale dynamic road networks. Comput. Optim. Appl. 45 (1) (2010)
Philippe Baptiste, Ruslan Sadykov
Time-indexed formulations for scheduling chains on a single machine: An application to airborne radars. Eur. J. Oper. Res. 203 (2) (2010)
Marek Chrobak, Philippe Baptiste, Christoph Dürr
Polynomial Time Algorithms for Minimum Energy Scheduling. Scheduling (2010)
Philippe Baptiste, Federico Della Croce, Andrea Grosso, Vincent T'kindt
Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances. J. Sched. 13 (1) (2010)
Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko
Integrality Property in Preemptive Parallel Machine Scheduling. CSR (2009)
Philippe Baptiste
Constraint-Based Schedulers, Do They Really Work? CP (2009)
Philippe Baptiste, Graham Kendall, Alix Munier, Francis Sourd
Preface. J. Sched. 12 (6) (2009)
J. Meng-Gérard, Philippe Chrétienne, Philippe Baptiste, Francis Sourd
On maximizing the profit of a satellite launcher: Selecting and scheduling tasks with time windows and setups. Discret. Appl. Math. 157 (17) (2009)
Philippe Baptiste, Marek Chrobak, Christoph Dürr
Polynomial Time Algorithms for Minimum Energy Scheduling CoRR (2009)
Giacomo Nannicini, Philippe Baptiste, Daniel Krob, Leo Liberti
Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks. COCOA (2008)
Konstantin Artiouchine, Philippe Baptiste, Juliette Mattioli
The K King Problem, an Abstract Model for Computing Aircraft Landing Trajectories: On Modeling a Dynamic Hybrid System with Constraints. INFORMS J. Comput. 20 (2) (2008)
Antoine Jouglet, David Savourey, Jacques Carlier, Philippe Baptiste
Dominance-based heuristics for one-machine total cost scheduling problems. Eur. J. Oper. Res. 184 (3) (2008)
Konstantin Artiouchine, Philippe Baptiste, Christoph Dürr
Runway sequencing with holding patterns. Eur. J. Oper. Res. 189 (3) (2008)
Philippe Baptiste, Marta Flamini, Francis Sourd
Lagrangian bounds for just-in-time job-shop scheduling. Comput. Oper. Res. 35 (3) (2008)
Philippe Baptiste, Marek Chrobak, Christoph Dürr
Polynomial Time Algorithms for Minimum Energy Scheduling. ESA (2007)
Giacomo Nannicini, Philippe Baptiste, Daniel Krob, Leo Liberti
Fast point-to-point shortest path queries on dynamic road networks with interfal data. CTW (2007)
Philippe Baptiste
Book review. Oper. Res. Lett. 35 (1) (2007)
Giacomo Nannicini, Philippe Baptiste, Gilles Barbier, Daniel Krob, Leo Liberti
Fast paths in large-scale dynamic road networks CoRR (2007)
Philippe Baptiste, Peter Brucker, Marek Chrobak, Christoph Dürr, Svetlana A. Kravchenko, Francis Sourd
The complexity of mean flow time scheduling problems with release times. J. Sched. 10 (2) (2007)
Konstantin Artiouchine, Philippe Baptiste
Arc-B-consistency of the Inter-distance Constraint. Constraints An Int. J. 12 (1) (2007)
Philippe Baptiste, Peter Brucker, Marek Chrobak, Christoph Dürr, Svetlana A. Kravchenko, Francis Sourd
The Complexity of Mean Flow Time Scheduling Problems with Release Times CoRR (2006)
Philippe Baptiste
Scheduling unit tasks to minimize the number of idle periods: a polynomial time algorithm for offline dynamic power management. SODA (2006)
David Savourey, Philippe Baptiste, Antoine Jouglet
Lower bounds for parallel machines scheduling. RIVF (2006)
Philippe Baptiste, Claude Le Pape
Scheduling a single machine to minimize a regular objective function under setup constraints. Discret. Optim. 2 (1) (2005)
Konstantin Artiouchine, Philippe Baptiste
Inter-distance Constraint: An Extension of the All-Different Constraint for Scheduling Equal Length Jobs. CP (2005)
Huy Trandac, Philippe Baptiste, Vu Duong
Airspace sectorization with constraints. RAIRO Oper. Res. 39 (2) (2005)
Philippe Baptiste, Jacques Carlier, Alix Munier, Andreas S. Schulz
Introduction. Ann. Oper. Res. 129 (1-4) (2004)
Philippe Baptiste, Marek Chrobak, Christoph Dürr, Wojciech Jawor, Nodari Vakhania
Preemptive scheduling of equal-length jobs to maximize weighted throughput. Oper. Res. Lett. 32 (3) (2004)
Dac-Huy Tran, Philippe Baptiste, Vu Duong
From Sets to Geometrical Sectors in the Airspace Sectorization Problem. RIVF (2004)
Philippe Baptiste, Jacques Carlier, Antoine Jouglet
A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates. Eur. J. Oper. Res. 158 (3) (2004)
Philippe Baptiste, Marek Chrobak, Christoph Dürr, Francis Sourd
Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time CoRR (2004)
Philippe Baptiste, Peter Brucker, Sigrid Knust, Vadim G. Timkovsky
Ten notes on equal-processing-time scheduling. 4OR 2 (2) (2004)
Philippe Baptiste, Sophie Demassey
Tight LP bounds for resource constrained project scheduling. OR Spectr. 26 (2) (2004)
Philippe Baptiste, Vadim G. Timkovsky
Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time. Math. Methods Oper. Res. 60 (1) (2004)
Philippe Baptiste, Laurent Péridy, Eric Pinson
A branch and bound to minimize the number of late jobs on a single machine with release time constraints. Eur. J. Oper. Res. 144 (1) (2003)
Philippe Baptiste
On minimizing the weighted number of late jobs in unit execution time open-shops. Eur. J. Oper. Res. 149 (2) (2003)
Huy Trandac, Philippe Baptiste, Vu Duong
Airspace Sectorization By Constraint Programming. RIVF (2003)
Philippe Baptiste, Baruch Schieber
A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness. J. Sched. 6 (4) (2003)
Philippe Baptiste
A note on scheduling multiprocessor tasks with identical processing times. Comput. Oper. Res. 30 (13) (2003)
Antoine Jouglet, Philippe Baptiste, Jacques Carlier
Exact procedures for single machine total cost scheduling. SMC (2002)
Philippe Baptiste, Marek Chrobak, Christoph Dürr, Wojciech Jawor, Nodari Vakhania
Preemptive Scheduling of Equal-Length Jobs to Maximize Weighted Throughput CoRR (2002)
Philippe Baptiste, Antoine Jouglet
On Minimizing Total Tardiness in a Serial Batching Problem. RAIRO Oper. Res. 35 (1) (2001)
Philippe Baptiste, Vadim G. Timkovsky
On preemption redundancy in scheduling unit processing time jobs on two parallel machines. Oper. Res. Lett. 28 (5) (2001)
Philippe Baptiste, Vadim G. Timkovsky
On preemption redundancy in scheduling unit processing time jobs on two parallel machines. IPDPS (2001)
Philippe Baptiste, Claude Le Pape
Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems. Constraints An Int. J. 5 (1/2) (2000)
Philippe Baptiste
Batching identical jobs. Math. Methods Oper. Res. 52 (3) (2000)
Philippe Baptiste
Scheduling equal-length jobs on identical parallel machines. Discret. Appl. Math. 103 (1-3) (2000)
Philippe Baptiste
) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Oper. Res. Lett. 24 (4) (1999)
Claude Le Pape, Philippe Baptiste
Heuristic Control of a Constraint-Based Algorithm for the Preemptive Job-Shop Scheduling Problem. J. Heuristics 5 (3) (1999)
Philippe Baptiste, Claude Le Pape, Wim Nuijten
Satisfiability tests and time‐bound adjustmentsfor cumulative scheduling problems. Ann. Oper. Res. 92 (1999)
Claude Le Pape, Philippe Baptiste
Resource Constraints for Preemptive Job-shop Scheduling. Constraints An Int. J. 3 (4) (1998)
Philippe Baptiste, Claude Le Pape, Laurent Péridy
Global Constraints for Partial CSPs: A Case-Study of Resource and Due Date Constraints. CP (1998)
Philippe Baptiste, Claude Le Pape
Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems. CP (1997)
Claude Le Pape, Philippe Baptiste
A Constraint Programming Library for Preemptive and Non-Preemptive Scheduling. PACT (1997)
Claude Le Pape, Philippe Baptiste
Constraint Propagation Techniques for Disjunctive Scheduling: The Preemptive Case. ECAI (1996)
Philippe Baptiste, Claude Le Pape
A Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling. IJCAI (1) (1995)