Philippe Baptiste Explained

Honorific Prefix:DR
Philippe Baptiste
Birth Date:28 March 1972
Nationality:French
Alma Mater:University of Technology of Compiègne, University of Strathclyde, Sorbonne University
Occupation:Academician, Civil Engineer, Scientist
CEO of CNES

Philippe Baptiste (born March 28, 1972) is a French engineer, academic and researcher. Baptiste is most well known as the president of the National Centre for Space Studies CNES in addition to his several books and scientific publications and communications in the field of algorithms, combinatorial optimization, operational research and artificial intelligence.[1]

Early life and education

Baptiste was born on March 28, 1972, in France. Baptise holds a PHD in computer science from the University of Technology of Compiègne additionally he is a civil engineering graduate from the Ecole des Mines engineering school in Nancy. Baptise also holds a Msc from the University of Strathclyde, Glasgow and holds a DEA postgraduate diploma from Sorbonne University and is a research director.[1] [2] Baptiste specialises in operational research and artificial intelligence(AI), combinatorial optimisation, and algorithms.

Career

In 1999 during his academic career, Baptiste was a researcher at the French National scientific research centre (CNRS), in addition to IBM's Watson Research Center during 2000 to 2001.[1]

Furthermore, for more than ten years during 2001 to 2012 Baptiste was a lecturer at France's Ecole Polytechnique engineering school. During this time he published several books and around 150 scientific papers, and became the head of Ecole Polytechnique engineering school's information technology laboratory and is credited with creating the Institute of Information Sciences and Interactions prior to being appointed Associate Director General in 2014 of CNRS.[1]

In 2016, Baptiste was appointed as Chief Scientific Officer and later in 2017 named Chief Technology Officer of oil, natural gas, and speciality chemicals company Total. Furthermore, Baptiste has aided in founding and developing a number of start-ups and followed several collaborations with digital, defence and aviation manufactures.[1]

During May 2017 to 2019, Batiste was named chief of staff to French-based biochemist, academic administrator, and politician who served as Minister of Higher Education Frédérique Vidal. After which in 2019 Batiste was an advisor to the French prime Minister Édouard Philippe, During this time Batiste was in close connection with the space policy.[1]

During 2020, Baptiste was appointed Partner and Director of American global management consulting firm Boston Consulting Group.[1]

Recognition

During 1999, Batisete was awarded the Prix Robert Faure award by the French Operations Research & Decision Support Society(ROADEF), a non-profit society that aims to promote scientific fields of operations Research and Decision in France. The award is in tribute to Professor Robert Faure and available to younger researchers (under 36) who are members of ROADEF, and is awarded every 3 years.[3]

In November 2000, Batiste was awarded the Cor Baayen Award for his PHD thesis in an ERCIM country which include: Cyprus, Poland, France, Germany, Austria, Greece, Italy, Norway, Portugal, The Netherlands, Finland and Sweden. Baptiste won this award fue to the quality of his PHD thesis and his previous publications and achievements up to the year 2000.[4]

Publications

2010–2019

2018

2017

2012

2011

2010

1999–2009

2009

2008

2007

2006

2005

2004

2003

2002

2001

2000

1990–1999

1999

1998

1997

1996

1995

See also

Notes and References

  1. Web site: 21 April 2021. CNES - Philippe Baptiste . 14 January 2022. CNES.
  2. Web site: Philippe Baptiste Appointed Senior Vice President, Scientific Development at Total. 2 August 2022. 10 August 2022.
  3. Web site: LE PRIX ROBERT FAURE. www.roadef.org. 10 August 2022.
  4. Web site: Philippe Baptiste Winner of the 2000 Cor Baayen Award. January 2001 . 10 August 2022.
  5. Web site: Philippe Baptiste . dblp.org . 10 August 2022.
  6. Baptiste . Philippe . Kovalyov . Mikhail Y. . Orlovich . Yury L. . Werner . Frank . Zverovich . Igor E. . 2017-01-10 . Graphs with maximal induced matchings of the same size . Discrete Applied Mathematics . Special Graph Classes and Algorithms — in Honor of Professor Andreas Brandstädt on the Occasion of His 65th Birthday . en . 216 . 15–28 . 10.1016/j.dam.2016.08.015 . 0166-218X.
  7. Baptiste . Ph. . Carlier . J. . Kononov . A. . Queyranne . M. . Sevastyanov . S. . Sviridenko . M. . 2012-11-01 . Integer preemptive scheduling on parallel machines . Operations Research Letters . en . 40 . 6 . 440–444 . 10.1016/j.orl.2012.06.011 . 0167-6377.
  8. Baptiste . Philippe . Chrobak . Marek . Dürr . Christoph . July 2012 . Polynomial-time algorithms for minimum energy scheduling . ACM Transactions on Algorithms . en . 8 . 3 . 1–29 . 10.1145/2229163.2229170 . 3092807 . 1549-6325. 0908.3505 .
  9. Baptiste . Ph. . Carlier . J. . Kononov . A. . Queyranne . M. . Sevastyanov . S. . Sviridenko . M. . 2011-03-06 . Properties of optimal schedules in preemptive shop scheduling . Discrete Applied Mathematics . en . 159 . 5 . 272–280 . 10.1016/j.dam.2010.11.015 . 0166-218X. free .
  10. Nannicini . Giacomo . Baptiste . Philippe . Barbier . Gilles . Krob . Daniel . Liberti . Leo . 2010-01-01 . Fast paths in large-scale dynamic road networks . Computational Optimization and Applications . en . 45 . 1 . 143–158 . 10.1007/s10589-008-9172-y . 0704.1068 . 458311 . 1573-2894.
  11. Baptiste . Philippe . 2010-03-06 . A note on scheduling identical coupled tasks in logarithmic time . Discrete Applied Mathematics . en . 158 . 5 . 583–587 . 10.1016/j.dam.2009.10.012 . 0166-218X.
  12. Baptiste . Philippe . Sadykov . Ruslan . 2010-06-01 . Time-indexed formulations for scheduling chains on a single machine: An application to airborne radars . European Journal of Operational Research . en . 203 . 2 . 476–483 . 10.1016/j.ejor.2009.07.037 . 6151721 . 0377-2217.
  13. Baptiste . P. . Della Croce . F. . Grosso . A. . T’kindt . V. . 2010-02-01 . Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances . Journal of Scheduling . en . 13 . 1 . 39–47 . 10.1007/s10951-008-0092-6 . 8279878 . 1099-1425.
  14. Chrobak . Marek . Baptiste . Philippe . Dürr . Christoph . 2010 . Albers . Susanne . Baruah . Sanjoy K. . Möhring . Rolf H. . Pruhs . Kirk . Polynomial Time Algorithms for Minimum Energy Scheduling . Scheduling . Dagstuhl Seminar Proceedings (DagSemProc) . Dagstuhl, Germany . Schloss Dagstuhl – Leibniz-Zentrum für Informatik . 10071 . 1–12 . 10.4230/DagSemProc.10071.8. free .
  15. Meng-Gérard . J. . Chrétienne . P. . Baptiste . P. . Sourd . F. . 2009-10-28 . On maximizing the profit of a satellite launcher: Selecting and scheduling tasks with time windows and setups . Discrete Applied Mathematics . Sixth International Conference on Graphs and Optimization 2007 . en . 157 . 17 . 3656–3664 . 10.1016/j.dam.2009.02.018 . 0166-218X. free .
  16. Baptiste . Philippe . Kendall . Graham . Munier . Alix . Sourd . Francis . 2009-10-16 . Preface . Journal of Scheduling . en . 12 . 6 . 563 . 10.1007/s10951-009-0136-6 . 214746603 . 1099-1425.
  17. Book: Baptiste . Philippe . Carlier . Jacques . Kononov . Alexander . Queyranne . Maurice . Sevastyanov . Sergey . Sviridenko . Maxim . Computer Science - Theory and Applications . Integrality Property in Preemptive Parallel Machine Scheduling . 2009 . Frid . Anna . Morozov . Andrey . Rybalchenko . Andrey . Wagner . Klaus W. . https://link.springer.com/chapter/10.1007/978-3-642-03351-3_6 . Lecture Notes in Computer Science . 5675 . en . Berlin, Heidelberg . Springer . 38–46 . 10.1007/978-3-642-03351-3_6 . 978-3-642-03351-3.
  18. Baptiste . Philippe . Chrobak . Marek . Durr . Christoph . 2010-09-03 . Polynomial Time Algorithms for Minimum Energy Scheduling . cs.DS . 0908.3505 .
  19. Baptiste . Philippe . Flamini . Marta . Sourd . Francis . 2008-03-01 . Lagrangian bounds for just-in-time job-shop scheduling . Computers & Operations Research . Part Special Issue: New Trends in Locational Analysis . en . 35 . 3 . 906–915 . 10.1016/j.cor.2006.05.009 . 0305-0548.
  20. Jouglet . Antoine . Savourey . David . Carlier . Jacques . Baptiste . Philippe . 2008-02-01 . Dominance-based heuristics for one-machine total cost scheduling problems . European Journal of Operational Research . en . 184 . 3 . 879–899 . 10.1016/j.ejor.2006.11.036 . 33657053 . 0377-2217.
  21. Artiouchine . Konstantin . Baptiste . Philippe . Dürr . Christoph . 2008-09-16 . Runway sequencing with holding patterns . European Journal of Operational Research . en . 189 . 3 . 1254–1266 . 10.1016/j.ejor.2006.06.076 . 0377-2217.
  22. Artiouchine . Konstantin . Baptiste . Philippe . Mattioli . Juliette . 2008-05-01 . 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 . 10.1287/ijoc.1070.0234 . 1091-9856.
  23. Book: Nannicini . Giacomo . Baptiste . Philippe . Krob . Daniel . Liberti . Leo . Combinatorial Optimization and Applications . Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks . 2008 . Yang . Boting . Du . Ding-Zhu . Wang . Cao An . https://link.springer.com/chapter/10.1007/978-3-540-85097-7_21 . Lecture Notes in Computer Science . 5165 . en . Berlin, Heidelberg . Springer . 225–234 . 10.1007/978-3-540-85097-7_21 . 978-3-540-85097-7.
  24. Artiouchine . Konstantin . Baptiste . Philippe . 2007-03-01 . Arc-B-consistency of the Inter-distance Constraint . Constraints . en . 12 . 1 . 3–19 . 10.1007/s10601-006-9009-1 . 2764020 . 1572-9354.
  25. Baptiste . Philippe . 2007-01-01 . Book review . Operations Research Letters . en . 35 . 1 . 139–140 . 10.1016/j.orl.2006.01.001 . 0167-6377.
  26. Baptiste . Philippe . Brucker . Peter . Chrobak . Marek . Dürr . Christoph . Kravchenko . Svetlana A. . Sourd . Francis . 2007-04-01 . The complexity of mean flow time scheduling problems with release times . Journal of Scheduling . en . 10 . 2 . 139–146 . 10.1007/s10951-006-0006-4 . 15059745 . 1099-1425.
  27. Nannicini . Giacomo . Baptiste . Philippe . Barbier . Gilles . Krob . Daniel . Liberti . Leo . 2007-06-27 . Fast paths in large-scale dynamic road networks . cs.NI . 0704.1068 .
  28. Book: Baptiste . Philippe . Chrobak . Marek . Dürr . Christoph . Algorithms – ESA 2007 . Polynomial Time Algorithms for Minimum Energy Scheduling . 2007 . Arge . Lars . Hoffmann . Michael . Welzl . Emo . https://drops.dagstuhl.de/opus/volltexte/2010/2535/ . Lecture Notes in Computer Science . 4698 . en . Berlin, Heidelberg . Springer . 136–150 . 10.1007/978-3-540-75520-3_14 . 978-3-540-75520-3.
  29. Book: Savourey . D. . Baptiste . P. . Jouglet . A. . 2006 International Conference onResearch, Innovation and Vision for the Future . Lower bounds for parallel machines scheduling . February 2006 . https://ieeexplore.ieee.org/document/1696437 . 195–198 . 10.1109/RIVF.2006.1696437. 1-4244-0316-2 . 37865848 .
  30. Book: Baptiste, Philippe . Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 . Scheduling unit tasks to minimize the number of idle periods . 2006-01-22 . https://dl.acm.org/doi/10.5555/1109557.1109598 . USA . Society for Industrial and Applied Mathematics . 364–367 . 10.1145/1109557.1109598 . 978-0-89871-605-4.
  31. Baptiste . Philippe . Brucker . Peter . Chrobak . Marek . Durr . Christoph . Kravchenko . Svetlana A. . Sourd . Francis . 2006-05-17 . The Complexity of Mean Flow Time Scheduling Problems with Release Times . cs/0605078 .
  32. Baptiste . Philippe . Le Pape . Claude . 2005-03-30 . Scheduling a single machine to minimize a regular objective function under setup constraints . Discrete Optimization . en . 2 . 1 . 83–99 . 10.1016/j.disopt.2004.12.003 . 1572-5286.
  33. Trandac . Huy . Baptiste . Philippe . Duong . Vu . 2005-04-01 . Airspace sectorization with constraints . RAIRO - Operations Research . en . 39 . 2 . 105–122 . 10.1051/ro:2005005 . 0399-0559.
  34. Book: Artiouchine . Konstantin . Baptiste . Philippe . Principles and Practice of Constraint Programming - CP 2005 . Inter-distance Constraint: An Extension of the All-Different Constraint for Scheduling Equal Length Jobs . 2005 . van Beek . Peter . https://link.springer.com/chapter/10.1007/11564751_8 . Lecture Notes in Computer Science . 3709 . en . Berlin, Heidelberg . Springer . 62–76 . 10.1007/11564751_8 . 978-3-540-32050-0.
  35. Baptiste . Philippe . Brucker . Peter . Knust . Sigrid . Timkovsky . Vadim G. . 2004-07-01 . Ten notes on equal-processing-time scheduling . Quarterly Journal of the Belgian, French and Italian Operations Research Societies . en . 2 . 2 . 111–127 . 10.1007/s10288-003-0024-4 . 45995160 . 1619-4500.
  36. Baptiste . Philippe . Carlier . Jacques . Munier . Alix . Schulz . Andreas . July 2004 . Introduction . Annals of Operations Research . en . 129 . 1–4 . 17–19 . 10.1023/B:ANOR.0000030779.01529.d2 . 221114747 . 0254-5330.
  37. Baptiste . Philippe . Carlier . Jacques . Jouglet . Antoine . 2004-11-01 . A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates . European Journal of Operational Research . en . 158 . 3 . 595–608 . 10.1016/S0377-2217(03)00378-3 . 7474157 . 0377-2217.
  38. Baptiste . Philippe . Timkovsky . Vadim G. . 2004-09-01 . Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time . Mathematical Methods of Operations Research . en . 60 . 1 . 145–153 . 10.1007/s001860300336 . 21247299 . 1432-5217.
  39. Baptiste . Philippe . Chrobak . Marek . Dürr . Christoph . Jawor . Wojciech . Vakhania . Nodari . 2004-05-01 . Preemptive scheduling of equal-length jobs to maximize weighted throughput . Operations Research Letters . en . 32 . 3 . 258–264 . 10.1016/j.orl.2003.09.004 . cs/0209033 . 8877838 . 0167-6377.
  40. Baptiste . Philippe . Demassey . Sophie . 2004-03-01 . Tight LP bounds for resource constrained project scheduling . OR Spectrum . en . 26 . 2 . 251–262 . 10.1007/s00291-003-0155-1 . 14139174 . 1436-6304.
  41. Web site: From Sets to Geometrical Sectors in the Airspace Sectorization Problem . 2022-08-10 . https://web.archive.org/web/20040710055518/http://e-ifi.org/rivf/2004/proceedings/ArticlesRIVR_04/p07-10.pdf . 2004-07-10 . dead.
  42. Baptiste . Philippe . Chrobak . Marek . Durr . Christoph . Sourd . Francis . 2004-12-20 . Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time . cs/0412094 .
  43. Baptiste . Philippe . 2003-11-01 . A note on scheduling multiprocessor tasks with identical processing times . Computers & Operations Research . en . 30 . 13 . 2071–2078 . 10.1016/S0305-0548(02)00116-8 . 0305-0548.
  44. Baptiste . Philippe . Peridy . Laurent . Pinson . Eric . 2003-01-01 . A branch and bound to minimize the number of late jobs on a single machine with release time constraints . European Journal of Operational Research . en . 144 . 1 . 1–11 . 10.1016/S0377-2217(01)00353-8 . 0377-2217.
  45. Baptiste . Philippe . 2003-09-01 . On minimizing the weighted number of late jobs in unit execution time open-shops . European Journal of Operational Research . Sequencing and Scheduling . en . 149 . 2 . 344–354 . 10.1016/S0377-2217(02)00759-2 . 0377-2217.
  46. Baptiste . Philippe . Schieber . Baruch . 2003-07-01 . A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness . Journal of Scheduling . en . 6 . 4 . 395–404 . 10.1023/A:1024012811536 . 3152736 . 1099-1425.
  47. Web site: e-ifi . 2022-08-10 .
  48. Résultats de complexité et programmation par contraintes pour l'ordonnancement . Université de Technologie de Compiègne . 2002-07-01 . thesis . en . Philippe . Baptiste.
  49. Book: Jouglet . A. . Baptiste . P. . Carlier . J. . IEEE International Conference on Systems, Man and Cybernetics . Exact procedures for single machine total cost scheduling . October 2002 . https://ieeexplore.ieee.org/document/1175623 . 6 . 4 pp. vol.6– . 10.1109/ICSMC.2002.1175623. 0-7803-7437-1 . 60540115 .
  50. Baptiste . Philippe . Chrobak . Marek . Durr . Christoph . Jawor . Wojciech . Vakhania . Nodari . 2003-03-11 . Preemptive Scheduling of Equal-Length Jobs to Maximize Weighted Throughput . cs/0209033 .
  51. Baptiste . Philippe . Timkovsky . Vadim G. . 2001-06-01 . On preemption redundancy in scheduling unit processing time jobs on two parallel machines . Operations Research Letters . en . 28 . 5 . 205–212 . 10.1016/S0167-6377(01)00068-2 . 15124866 . 0167-6377.
  52. Baptiste . Philippe . Jouglet . Antoine . 2001-01-01 . On Minimizing Total Tardiness in a Serial Batching Problem . RAIRO - Operations Research . en . 35 . 1 . 107–115 . 10.1051/ro:2001105 . 0399-0559.
  53. Book: Baptiste . P. . Timkovsky . V.G. . Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001 . On preemption redundancy in scheduling unit processing time jobs on two parallel machines . April 2001 . https://ieeexplore.ieee.org/document/925215 . 2152–2156 . 10.1109/IPDPS.2001.925215. 0-7695-0990-8 .
  54. Baptiste . Philippe . Pape . Claude Le . 2000-01-01 . Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems . Constraints . en . 5 . 1 . 119–139 . 10.1023/A:1009822502231 . 18722332 . 1572-9354.
  55. Baptiste . Philippe . 2000-07-15 . Scheduling equal-length jobs on identical parallel machines . Discrete Applied Mathematics . en . 103 . 1 . 21–32 . 10.1016/S0166-218X(99)00238-3 . 0166-218X. free .
  56. Baptiste . Philippe . 2000-12-01 . Batching identical jobs . Mathematical Methods of Operations Research . en . 52 . 3 . 355–367 . 10.1007/s001860000088 . 11153349 . 1432-5217.
  57. Baptiste . Ph. . Le Pape . C. . Nuijten . W. . 1999-01-01 . Satisfiability tests and time-bound adjustmentsfor cumulative scheduling problems . Annals of Operations Research . en . 92 . 305–333 . 10.1023/A:1018995000688 . 6375958 . 1572-9338.
  58. Pape . Claude Le . Baptiste . Philippe . 1999-10-01 . Heuristic Control of a Constraint-Based Algorithm for the Preemptive Job-Shop Scheduling Problem . Journal of Heuristics . en . 5 . 3 . 305–325 . 10.1023/A:1009613717770 . 11933524 . 1572-9397.
  59. Baptiste . Philippe . 1999-05-01 . An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs . Operations Research Letters . en . 24 . 4 . 175–180 . 10.1016/S0167-6377(98)00045-5 . 0167-6377.
  60. Pape . Claude Le . Baptiste . Philippe . 1998-10-01 . Resource Constraints for Preemptive Job-shop Scheduling . Constraints . en . 3 . 4 . 263–287 . 10.1023/A:1009723704757 . 12808854 . 1572-9354.
  61. Book: Baptiste . Philippe . Le Pape . Claude . Peridy . Laurent . Principles and Practice of Constraint Programming — CP98 . Global Constraints for Partial CSPS: A Case-Study of Resource and Due Date Constraints . 1998 . Maher . Michael . Puget . Jean-Francois . https://link.springer.com/chapter/10.1007/3-540-49481-2_8 . Lecture Notes in Computer Science . 1520 . en . Berlin, Heidelberg . Springer . 87–101 . 10.1007/3-540-49481-2_8 . 978-3-540-49481-2.
  62. Book: Baptiste . Philippe . Le Pape . Claude . Principles and Practice of Constraint Programming-CP97 . Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems . 1997 . Smolka . Gert . https://link.springer.com/chapter/10.1007/BFb0017454 . Lecture Notes in Computer Science . 1330 . en . Berlin, Heidelberg . Springer . 375–389 . 10.1007/BFb0017454 . 978-3-540-69642-1.

This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Philippe Baptiste".

Except where otherwise indicated, Everything.Explained.Today is © Copyright 2009-2024, A B Cryer, All Rights Reserved. Cookie policy.