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

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

A Constraint Programming Library for Preemptive and Non-Preemptive Scheduling. - Claude Le Pape; Philippe Baptiste (PACT, 1997)

Global Constraints for Partial CSPs: A Case-Study of Resource and Due Date Constraints. - Philippe Baptiste; Claude Le Pape; Laurent Péridy (CP, 1998)

Resource Constraints for Preemptive Job-shop Scheduling. - Claude Le Pape; Philippe Baptiste (Constraints An Int. J., 1998)

Satisfiability tests and time‐bound adjustmentsfor cumulative scheduling problems. - Philippe Baptiste; Claude Le Pape; Wim Nuijten (Ann. Oper. Res., 1999)

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

An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. - Philippe Baptiste (Oper. Res. Lett., 1999)

Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems. - Philippe Baptiste; Claude Le Pape (Constraints An Int. J., 2000)

Scheduling equal-length jobs on identical parallel machines. - Philippe Baptiste (Discret. Appl. Math., 2000)

Batching identical jobs. - Philippe Baptiste (Math. Methods Oper. Res., 2000)

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

On Minimizing Total Tardiness in a Serial Batching Problem. - Philippe Baptiste; Antoine Jouglet (RAIRO Oper. Res., 2001)

Résultats de complexité et programmation par contraintes pour l'ordonnancement. - Philippe Baptiste (2002)

Exact procedures for single machine total cost scheduling. - Antoine Jouglet; Philippe Baptiste; Jacques Carlier (SMC, 2002)

Airspace Sectorization By Constraint Programming. - Huy Trandac; Philippe Baptiste; Vu Duong (RIVF, 2003)

A note on scheduling multiprocessor tasks with identical processing times. - Philippe Baptiste (Comput. Oper. Res., 2003)

On minimizing the weighted number of late jobs in unit execution time open-shops. - Philippe Baptiste (Eur. J. Oper. Res., 2003)

A branch and bound to minimize the number of late jobs on a single machine with release time constraints. - Philippe Baptiste; Laurent Péridy; Eric Pinson (Eur. J. Oper. Res., 2003)

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

From Sets to Geometrical Sectors in the Airspace Sectorization Problem. - Dac-Huy Tran; Philippe Baptiste; Vu Duong (RIVF, 2004)

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

Introduction. - Philippe Baptiste; Jacques Carlier; Alix Munier; Andreas S. Schulz (Ann. Oper. Res., 2004)

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

A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates. - Philippe Baptiste; Jacques Carlier; Antoine Jouglet (Eur. J. Oper. Res., 2004)

Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time. - Philippe Baptiste; Vadim G. Timkovsky (Math. Methods Oper. Res., 2004)

Preemptive scheduling of equal-length jobs to maximize weighted throughput. - Philippe Baptiste; Marek Chrobak; Christoph Dürr; Wojciech Jawor; Nodari Vakhania (Oper. Res. Lett., 2004)

Tight LP bounds for resource constrained project scheduling. - Philippe Baptiste; Sophie Demassey (OR Spectr., 2004)

Scheduling Equal Processing Time Jobs. - Philippe Baptiste; Peter Brucker (Handbook of Scheduling, 2004)

Branch-and-Bound Algorithms for TotalWeighted Tardiness. - Antoine Jouglet; Philippe Baptiste; Jacques Carlier (Handbook of Scheduling, 2004)

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

Scheduling a single machine to minimize a regular objective function under setup constraints. - Philippe Baptiste; Claude Le Pape (Discret. Optim., 2005)

Airspace sectorization with constraints. - Huy Trandac; Philippe Baptiste; Vu Duong (RAIRO Oper. Res., 2005)

Lower bounds for parallel machines scheduling. - David Savourey; Philippe Baptiste; Antoine Jouglet (RIVF, 2006)

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

Constraint-Based Scheduling and Planning. - Philippe Baptiste; Philippe Laborie; Claude Le Pape; Wim Nuijten (Handbook of Constraint Programming, 2006)

Fast point-to-point shortest path queries on dynamic road networks with interfal data. - Giacomo Nannicini; Philippe Baptiste; Daniel Krob; Leo Liberti (CTW, 2007)

Arc-B-consistency of the Inter-distance Constraint. - Konstantin Artiouchine; Philippe Baptiste (Constraints An Int. J., 2007)

Book review. - Philippe Baptiste (Oper. Res. Lett., 2007)

The complexity of mean flow time scheduling problems with release times. - Philippe Baptiste; Peter Brucker; Marek Chrobak; Christoph Dürr; Svetlana A. Kravchenko; Francis Sourd (J. Sched., 2007)

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

Lagrangian bounds for just-in-time job-shop scheduling. - Philippe Baptiste; Marta Flamini; Francis Sourd (Comput. Oper. Res., 2008)

Runway sequencing with holding patterns. - Konstantin Artiouchine; Philippe Baptiste; Christoph Dürr (Eur. J. Oper. Res., 2008)

Dominance-based heuristics for one-machine total cost scheduling problems. - Antoine Jouglet; David Savourey; Jacques Carlier; Philippe Baptiste (Eur. J. Oper. Res., 2008)

The K King Problem, an Abstract Model for Computing Aircraft Landing Trajectories: On Modeling a Dynamic Hybrid System with Constraints. - Konstantin Artiouchine; Philippe Baptiste; Juliette Mattioli (INFORMS J. Comput., 2008)

Constraint-Based Schedulers, Do They Really Work? - Philippe Baptiste (CP, 2009)

Integrality Property in Preemptive Parallel Machine Scheduling. - Philippe Baptiste; Jacques Carlier; Alexander V. Kononov; Maurice Queyranne; Sergey Sevastyanov; Maxim Sviridenko (CSR, 2009)

On maximizing the profit of a satellite launcher: Selecting and scheduling tasks with time windows and setups. - J. Meng-Gérard; Philippe Chrétienne; Philippe Baptiste; Francis Sourd (Discret. Appl. Math., 2009)

Preface. - Philippe Baptiste; Graham Kendall; Alix Munier; Francis Sourd (J. Sched., 2009)

Fast paths in large-scale dynamic road networks. - Giacomo Nannicini; Philippe Baptiste; Gilles Barbier; Daniel Krob; Leo Liberti (Comput. Optim. Appl., 2010)

A note on scheduling identical coupled tasks in logarithmic time. - Philippe Baptiste (Discret. Appl. Math., 2010)

Time-indexed formulations for scheduling chains on a single machine: An application to airborne radars. - Philippe Baptiste; Ruslan Sadykov (Eur. J. Oper. Res., 2010)

Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances. - Philippe Baptiste; Federico Della Croce; Andrea Grosso; Vincent T'kindt (J. Sched., 2010)

Properties of optimal schedules in preemptive shop scheduling. - Philippe Baptiste; Jacques Carlier; Alexander V. Kononov; Maurice Queyranne; Sergey Sevastyanov; Maxim Sviridenko (Discret. Appl. Math., 2011)

Integer preemptive scheduling on parallel machines. - Philippe Baptiste; Jacques Carlier; Alexander V. Kononov; Maurice Queyranne; Sergey Sevastyanov; Maxim Sviridenko (Oper. Res. Lett., 2012)

Polynomial-time algorithms for minimum energy scheduling. - Philippe Baptiste; Marek Chrobak; Christoph Dürr (ACM Trans. Algorithms, 2012)

Graphs with maximal induced matchings of the same size. - Philippe Baptiste; Mikhail Y. Kovalyov; Yury L. Orlovich; Frank Werner 001; Igor E. Zverovich (Discret. Appl. Math., 2017)

Redundant cumulative constraints to compute preemptive bounds. - Philippe Baptiste; Nicolas Bonifas (Discret. Appl. Math., 2018)