Philippe Baptiste

Philippe Baptiste, Jacques Carlier, Alexander Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko: Integer preemptive scheduling on parallel machines. Oper. Res. Lett. 40(6): 440-444 (2012)

Philippe Baptiste, Marek Chrobak, Christoph Dürr: Polynomial-time algorithms for minimum energy scheduling. ACM Transactions on Algorithms 8(3): 26 (2012)

Philippe Baptiste, Jacques Carlier, Alexander Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko: Properties of optimal schedules in preemptive shop scheduling. Discrete Applied Mathematics 159(5): 272-280 (2011)

Giacomo Nannicini, Philippe Baptiste, Gilles Barbier, Daniel Krob, Leo Liberti: Fast paths in large-scale dynamic road networks. Comp. Opt. and Appl. 45(1): 143-158 (2010)

Philippe Baptiste: A note on scheduling identical coupled tasks in logarithmic time. Discrete Applied Mathematics 158(5): 583-587 (2010)

Philippe Baptiste, Ruslan Sadykov: Time-indexed formulations for scheduling chains on a single machine: An application to airborne radars. European Journal of Operational Research 203(2): 476-483 (2010)

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. Discrete Applied Mathematics 157(17): 3656-3664 (2009)

Philippe Baptiste, Graham Kendall, Alix Munier, Francis Sourd: Preface. J. Scheduling 12(6): 563-564 (2009)

Philippe Baptiste: Constraint-Based Schedulers, Do They Really Work? CP 2009: 1

Philippe Baptiste, Jacques Carlier, Alexander Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko: Integrality Property in Preemptive Parallel Machine Scheduling. CSR 2009: 38-46

Philippe Baptiste, Marek Chrobak, Christoph Dürr: Polynomial Time Algorithms for Minimum Energy Scheduling. CoRR abs/0908.3505 (2009)

Philippe Baptiste, Marta Flamini, Francis Sourd: Lagrangian bounds for just-in-time job-shop scheduling. Computers & OR 35(3): 906-915 (2008)

Antoine Jouglet, David Savourey, Jacques Carlier, Philippe Baptiste: Dominance-based heuristics for one-machine total cost scheduling problems. European Journal of Operational Research 184(3): 879-899 (2008)

Konstantin Artiouchine, Philippe Baptiste, Christoph Dürr: Runway sequencing with holding patterns. European Journal of Operational Research 189(3): 1254-1266 (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 Journal on Computing 20(2): 222-233 (2008)

Giacomo Nannicini, Philippe Baptiste, Daniel Krob, Leo Liberti: Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks. COCOA 2008: 225-234

Konstantin Artiouchine, Philippe Baptiste: Arc-B-consistency of the Inter-distance Constraint. Constraints 12(1): 3-19 (2007)

Philippe Baptiste: Book review. Oper. Res. Lett. 35(1): 139-140 (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. Scheduling 10(2): 139-146 (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: 115-118

Philippe Baptiste, Marek Chrobak, Christoph Dürr: Polynomial Time Algorithms for Minimum Energy Scheduling. ESA 2007: 136-150

Giacomo Nannicini, Philippe Baptiste, Gilles Barbier, Daniel Krob, Leo Liberti: Fast paths in large-scale dynamic road networks. CoRR abs/0704.1068 (2007)

David Savourey, Philippe Baptiste, Antoine Jouglet: Lower bounds for parallel machines scheduling. RIVF 2006: 195-198

Philippe Baptiste: Scheduling unit tasks to minimize the number of idle periods: a polynomial time algorithm for offline dynamic power management. SODA 2006: 364-367

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 abs/cs/0605078 (2006)

Philippe Baptiste, Claude Le Pape: Scheduling a single machine to minimize a regular objective function under setup constraints. Discrete Optimization 2(1): 83-99 (2005)

Huy Trandac, Philippe Baptiste, Vu Duong: Airspace sectorization with constraints. RAIRO - Operations Research 39(2): 105-122 (2005)

Konstantin Artiouchine, Philippe Baptiste: Inter-distance Constraint: An Extension of the All-Different Constraint for Scheduling Equal Length Jobs. CP 2005: 62-76

Philippe Baptiste, Peter Brucker, Sigrid Knust, Vadim G. Timkovsky: Ten notes on equal-processing-time scheduling. 4OR 2(2): 111-127 (2004)

Philippe Baptiste, Jacques Carlier, Alix Munier, Andreas S. Schulz: Introduction. Annals OR 129(1-4): 17-19 (2004)

Philippe Baptiste, Jacques Carlier, Antoine Jouglet: A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates. European Journal of Operational Research 158(3): 595-608 (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. Meth. of OR 60(1): 145-153 (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): 258-264 (2004)

Dac-Huy Tran, Philippe Baptiste, Vu Duong: From Sets to Geometrical Sectors in the Airspace Sectorization Problem. RIVF 2004: 7-10

Philippe Baptiste, Marek Chrobak, Christoph Dürr, Francis Sourd: Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time. CoRR abs/cs/0412094 (2004)

Philippe Baptiste: A note on scheduling multiprocessor tasks with identical processing times. Computers & OR 30(13): 2071-2078 (2003)

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. European Journal of Operational Research 144(1): 1-11 (2003)

Philippe Baptiste: On minimizing the weighted number of late jobs in unit execution time open-shops. European Journal of Operational Research 149(2): 344-354 (2003)

Philippe Baptiste, Baruch Schieber: A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness. J. Scheduling 6(4): 395-404 (2003)

Huy Trandac, Philippe Baptiste, Vu Duong: Airspace Sectorization By Constraint Programming. RIVF 2003: 49-58

Philippe Baptiste, Marek Chrobak, Christoph Dürr, Wojciech Jawor, Nodari Vakhania: Preemptive Scheduling of Equal-Length Jobs to Maximize Weighted Throughput. CoRR cs.DS/0209033 (2002)

Philippe Baptiste, Vadim G. Timkovsky: On preemption redundancy in scheduling unit processing time jobs on two parallel machines. Oper. Res. Lett. 28(5): 205-212 (2001)

Philippe Baptiste, Antoine Jouglet: On Minimizing Total Tardiness in a Serial Batching Problem. RAIRO - Operations Research 35(1): 107-115 (2001)

Philippe Baptiste, Vadim G. Timkovsky: On preemption redundancy in scheduling unit processing time jobs on two parallel machines. IPDPS 2001: 200

Philippe Baptiste, Claude Le Pape: Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems. Constraints 5(1/2): 119-139 (2000)

Philippe Baptiste: Scheduling equal-length jobs on identical parallel machines. Discrete Applied Mathematics 103(1-3): 21-32 (2000)

Philippe Baptiste: Batching identical jobs. Math. Meth. of OR 52(3): 355-367 (2000)

Claude Le Pape, Philippe Baptiste: Heuristic Control of a Constraint-Based Algorithm for the Preemptive Job-Shop Scheduling Problem. J. Heuristics 5(3): 305-325 (1999)

Philippe Baptiste: An O(n⁴) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Oper. Res. Lett. 24(4): 175-180 (1999)

Claude Le Pape, Philippe Baptiste: Resource Constraints for Preemptive Job-shop Scheduling. Constraints 3(4): 263-287 (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: 87-101

Philippe Baptiste, Claude Le Pape: Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems. CP 1997: 375-389

Claude Le Pape, Philippe Baptiste: Constraint Propagation Techniques for Disjunctive Scheduling: The Preemptive Case. ECAI 1996: 619-623

Philippe Baptiste, Claude Le Pape: A Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling. IJCAI (1) 1995: 600-606