Philippe Baptiste

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