Philippe BAPTISTE home page I'm a researcher at CNRS INST2I and I'm the director of the joint CS research lab between CNRS and Ecole Polytechnique LIX. I'm also teaching at Polytechnique as a "Prof. chargé de cours" Research Interest: Op. Research, Scheduling theory, Constraint Prog.,  Air Traffic Management

We need help to solve these open problems

Feeling a bit depressed ? Not making any progress ? Have a look there (in french)

Have a look to the pages of the team "Optimization and algorithms"

Ads - Books (each time you buy one I get a free coffe by my editor)

Editorial Duties

Since january 2009, I'm the editor in chief (jointly with S. Martello and F. Plastria) of 4OR: A Quarterly Journal of Operations Research (thanks a lot to D. Bouyssou who has been in charge for many years)   I'm also an associate editor of the following journals Journal of Scheduling Operations Research Letters Discrete Optimization Constraints Constraint Programming Letters

I'm / I was also a PC member of several conferences, including STACS WAOA ATM MISTA CPAIOR RIVF ROADEF JNPC ICRAT

Links for students

PhD Students

Papers in international journal 

Some conference papers (for a complete list check my resume)

• G. Nannicini, Ph. Baptiste, D. Krob, and L. Liberti. Fast computation of point-to-point paths on time-dependent road networks. Proceedings of COCOA 08, volume 5165 of Lecture Notes in Computer Science, pages 225-234. Springer, 2008.
• Giacomo Nannicini, Ph. Baptiste, Daniel Krob, Leo Liberti, Fast point-to-point shortest path queries on dynamic road networks with interval data, Cologne/Twente Workshop on Graphs and Combinatorial Optimization 2007, CTW 2007 Proceedings, Enschede, May 2007.
• Ph. Baptiste, Marek Chrobak and Christoph Durr. Polynomial Time Algorithms for Minimum Energy Scheduling,  15th Annual European Symposium on Algorithms (ESA), Eilat, Israel, October 8-10, 2007
• Ph. Baptiste, Alexander Kononov and Maxim Sviridenko New lower bound for the flow shop scheduling, Eighth Workshop On Models And Algorithms For Planning And Scheduling Problems, Koç University, Turkey, 2007.
• Ph. Baptiste, R. Sadykov. Compact MIP formulations for minimizing total weighted tardiness. Proc. of the 10th International Workshop on Project Management and Scheduling, 2006.
• Ph. Baptiste. Scheduling Unit Tasks to Minimize the Number of Idle Periods: A Polynomial Time Algorithm for Offline Dynamic Power Management. Ph. Baptiste. SODA'06, ACM-SIAM Symposium on Discrete Algorithms, Miami, January 2006.
• K. Artiouchine and Ph. Baptiste. Inter-Distance Constraint: An Extension of the All-Different Constraint for Scheduling Equal Length Jobs. Proc. of the 11th International Conference, CP (Principles and Practice of Constraint Programming), Sitges, Spain, Lecture Notes in Computer Science Volume 3709 / 2005.
• Ph. Baptiste, M. Chrobak, C. Durr and F. Sourd. Preemptive multi-machine scheduling of equal length jobs to minimize the average flow time, Models and Algorithms for Planning and Scheduling Problems, Siena, Italy, June 6-10, 2005.
• C. Le Pape and Ph. Baptiste. Scheduling a Single Machine to Minimize a Regular Objective Function under Setup Constraints. 2nd Multidisciplinary International Conference on Scheduling : Theory and Applications, July 2005.
• K. Artiouchine,  Ph. Baptiste and C. Dürr. Runway Scheduling With Holding Loop. The Second International Workshop DOM – Discrete Optimization Methods in Production and Logistics July 20-27, 2004, Omsk - Irkutsk, Russia 2004.
• Ph. Baptiste and Francis Sourd. Lower bounds for the earliness-tardiness scheduling problem on parallel machines. Proceedings of the Proc. of the 9th International Workshop on Project Management and Scheduling, 2004.
• Ph. Baptiste and Peter Brucker. Scheduling Parallel Machines to Minimize Total Completion Time and Total Number of Late Jobs. Proceedings of the Proc. of the 9th International Workshop on Project Management and Scheduling, 2004.
• D. Savourey, A. Jouglet, Ph. Baptiste and Jacques Carlier. A Tabu Search Method to Minimize Total (Weighted) Tardiness on One Machine with Release Dates. Proceedings of the Proc. of the 9th International Workshop on Project Management and Scheduling, 2004.
• S. Demassey, C. Artigues , Ph. Baptiste and Ph. Michelon. Lagrangean relaxation-based lower bounds for the RCPSP. Proceedings of the Proc. of the 9th International Workshop on Project Management and Scheduling, 2004.
• A. Jouglet, Ph. Baptiste, J. Carlier and D. Savourey. Dominance Based Heuristics to Minimize a Total Cost on One Machine, 1st Multidisciplinary International Conference on Scheduling : Theory and Applications, August 2003, Nottingham, UK.
• A. Jouglet, Ph. Baptiste, J. Carlier. The One Machine Total Cost Scheduling Problem with Release Dates, 1st Multidisciplinary International Conference on Scheduling : Theory and Applications, August 2003, Nottingham, UK.
•  Huy Tran Dac and Ph. Baptiste. Optimized Sectorization of Airspace with Constraints. 5th Air Traffic Management R&D Seminar, Budapest, 2003.
• Ph. Baptiste and M. Sviridenko. Structural properties of preemptive parallel machine schedules. Proc. of the Sixth Workshop on Models and Algorithms for Planning and Scheduling Problems, 2003. 
• H. Tran-Dac and Ph. Baptiste. A CP approach for Dynamic Airspace Reconfiguration. Proc. of the 21st Digital Avionics Systems Conference, Irvine, California, 2002.
• A. Jouglet, Ph. Baptiste, J. Carlier,  Exact Procedures for Single Machine Total Cost Scheduling, IEEE International Conference on Systems, Man and Cybernetics, Hammamet, Tunisia, 2002.
• Ph. Baptiste and B. Schieber. Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness. Proc. of the 8th International Workshop on Project Management and Scheduling, Valencia, Spain, 2002.
• A. Jouglet, Ph. Baptiste, J. Carlier, A Branch and Bound Procedure to Minimize Total Tardiness or Total Completion time on One Machine with Different Release Date, 8th International Workshop on Project Management and Scheduling, Valencia, Spain, 2002.
• A. Jouglet, Ph. Baptiste and J. Carlier. Minimizing total tardiness on one machine with release dates: 1 |ri | Σ Ti. Fifth Workshop on Models and Algorithms for Planning and Scheduling Problems, Aussois, 2001.
• Ph. Baptiste. Preemptive Scheduling of Identical Machines. Fifth Workshop on Models and Algorithms for Planning and Scheduling Problems, Aussois, 2001.
• Ph. Baptiste and V. Timkovsky. On Preemption Redundancy In Scheduling Unit Processing Time Jobs On Two Parallel Machines. International Workshop on Scheduling and Telecommunications (IWST), San Francisco, California, USA, 2001.
• Ph. Baptiste. On Minimizing the Weighted Number of Late Jobs in Unit Execution Time Open-Shops. Proc. of the 7th International Workshop on Project Management and Scheduling, Osnabrueck, Germany, 2000.
• Ph. Baptiste. Scheduling Equal Length Jobs. Fourth Workshop on Models and Algorithms for Planning and Scheduling Problems, Renesse, Pays-Bas, 1999.
• A. Jouglet, Ph. Baptiste and W. Nuijten. A Branch and Bound Procedure to Minimize the Weighted Number of Late Jobs on Parallel Identical Machines. Fourth Workshop on Models and Algorithms for Planning and Scheduling Problems, Renesse, The Netherlands, 1999.
• E. Néron, Ph. Baptiste, J. Carlier and C. Le Pape. Global Operations for the Multi-Processor Flow-Shop. Proc. of the 6th International Workshop on Project Management and Scheduling, Istanbul, 1998.
• L. Péridy, Ph. Baptiste, E. Pinson. Branch and Bound Method for the problem 1 | ri  | ΣUi. Proc. of the 6th International Workshop on Project Management and Scheduling, Istanbul, 1998.
• Ph. Baptiste and C. Le Pape. Adjustments of Release and Due Dates for Cumulative Scheduling Problems. Proc. of the 3rd International Conference on Industrial Engineering and Production Management, Lyon, 1997.
• Ph. Baptiste and C. Le Pape. A Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling. Proc. of the 14th International Joint Conference on Artificial Intelligence, Montréal, 1995.
• C. Le Pape and Ph. Baptiste. A Constraint Programming Library for Preemptive and Non-Preemptive Scheduling. Proc. of the Third International Conference and Exhibition on the Practical Application of Constraint Technology, London, 1997.
• C. Le Pape and Ph. Baptiste. Constraint Propagation Techniques for Disjunctive Scheduling: The Preemptive Case. Proc. of the 12th European Conference on Artificial Intelligence, Budapest, 1996.

Habilitation (HDR), PhD & MSc Thesis

Philippe Baptiste. Resultats de complexité et programmation par contraintes pour l'ordonnancement. Habilitation a diriger des recherches presentee le 1er juillet 2002 devant le jury compose de Jacques Carlier, Philippe Chretienne, Bernard Dubuisson, Pascal van Hentenryck, Jan-Karel Lenstra, Claude Le Pape, Eric Pinson and Baruch Schieber.

Philippe Baptiste.A Theoretical and Experimental Study of Resource Constraint Propagation . PhDThesis, University of Compiègne, 1998. ( Compressed Word version , pdf )

Philippe Baptiste. Resource Constraints for Preemptive and Non-Preemptive Scheduling. MSc Thesis, University Paris VI, 1995. (Compressed postscript version)

Philippe Baptiste. Constraint-Based Scheduling: Two extensions. MSc Thesis, University of Strathclyde, 1994. (Compressed postscript version)