Philippe Baptiste: Difference between revisions

From Wikipedia, the free encyclopedia
Browse history interactively
← Previous editNext edit →
Content deleted Content added
VisualWikitext
→‎Publications: fixed referance
→‎Publications: referances
Line 25: Line 25:
*Philippe Baptiste, Nicolas Bonifas: Redundant cumulative constraints to compute preemptive bounds. Discret. Appl. Math. 234: 168-177 (2018)<ref name ='publications">{{cite web|url=https://dblp.org/pid/68/3558.html|title=Philippe Baptiste|website=dblp.org|access-date=10 August 2022|url-status=live}}</ref>
*Philippe Baptiste, Nicolas Bonifas: Redundant cumulative constraints to compute preemptive bounds. Discret. Appl. Math. 234: 168-177 (2018)<ref name ='publications">{{cite web|url=https://dblp.org/pid/68/3558.html|title=Philippe Baptiste|website=dblp.org|access-date=10 August 2022|url-status=live}}</ref>
====2017====
====2017====
*Philippe Baptiste, Mikhail Y. Kovalyov, Yury L. Orlovich, Frank Werner, Igor E. Zverovich: Graphs with maximal induced matchings of the same size. Discret. Appl. Math. 216: 15-28 (2017)<ref name ='publications"/>
*Philippe Baptiste, Mikhail Y. Kovalyov, Yury L. Orlovich, Frank Werner, Igor E. Zverovich: Graphs with maximal induced matchings of the same size. Discret. Appl. Math. 216: 15-28 (2017)<ref>{{Cite journal |last=Baptiste |first=Philippe |last2=Kovalyov |first2=Mikhail Y. |last3=Orlovich |first3=Yury L. |last4=Werner |first4=Frank |last5=Zverovich |first5=Igor E. |date=2017-01-10 |title=Graphs with maximal induced matchings of the same size |url=https://www.sciencedirect.com/science/article/pii/S0166218X16303924 |journal=Discrete Applied Mathematics |series=Special Graph Classes and Algorithms — in Honor of Professor Andreas Brandstädt on the Occasion of His 65th Birthday |language=en |volume=216 |pages=15–28 |doi=10.1016/j.dam.2016.08.015 |issn=0166-218X}}</ref>
====2012====
====2012====
*Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko: Integer preemptive scheduling on parallel machines. Oper. Res. Lett. 40(6): 440-444 (2012)<ref name ='publications"/>
*Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko: Integer preemptive scheduling on parallel machines. Oper. Res. Lett. 40(6): 440-444 (2012)<ref>{{Cite journal |last=Baptiste |first=Ph. |last2=Carlier |first2=J. |last3=Kononov |first3=A. |last4=Queyranne |first4=M. |last5=Sevastyanov |first5=S. |last6=Sviridenko |first6=M. |date=2012-11-01 |title=Integer preemptive scheduling on parallel machines |url=https://www.sciencedirect.com/science/article/pii/S0167637712000922 |journal=Operations Research Letters |language=en |volume=40 |issue=6 |pages=440–444 |doi=10.1016/j.orl.2012.06.011 |issn=0167-6377}}</ref>


*Philippe Baptiste, Marek Chrobak, Christoph Dürr: Polynomial-time algorithms for minimum energy scheduling. ACM Trans. Algorithms 8(3): 26:1-26:29 (2012)<ref name ='publications"/>
*Philippe Baptiste, Marek Chrobak, Christoph Dürr: Polynomial-time algorithms for minimum energy scheduling. ACM Trans. Algorithms 8(3): 26:1-26:29 (2012)<ref>{{Cite journal |last=Baptiste |first=Philippe |last2=Chrobak |first2=Marek |last3=Dürr |first3=Christoph |date=2012-07 |title=Polynomial-time algorithms for minimum energy scheduling |url=https://dl.acm.org/doi/10.1145/2229163.2229170 |journal=ACM Transactions on Algorithms |language=en |volume=8 |issue=3 |pages=1–29 |doi=10.1145/2229163.2229170 |issn=1549-6325}}</ref>
====2011====
====2011====
*Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko: Properties of optimal schedules in preemptive shop scheduling. Discret. Appl. Math. 159(5): 272-280 (2011)<ref name ='publications"/>
*Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko: Properties of optimal schedules in preemptive shop scheduling. Discret. Appl. Math. 159(5): 272-280 (2011)<ref>{{Cite journal |last=Baptiste |first=Ph. |last2=Carlier |first2=J. |last3=Kononov |first3=A. |last4=Queyranne |first4=M. |last5=Sevastyanov |first5=S. |last6=Sviridenko |first6=M. |date=2011-03-06 |title=Properties of optimal schedules in preemptive shop scheduling |url=https://www.sciencedirect.com/science/article/pii/S0166218X10003987 |journal=Discrete Applied Mathematics |language=en |volume=159 |issue=5 |pages=272–280 |doi=10.1016/j.dam.2010.11.015 |issn=0166-218X}}</ref>
====2010====
====2010====
*Giacomo Nannicini, Philippe Baptiste, Gilles Barbier, Daniel Krob, Leo Liberti: Fast paths in large-scale dynamic road networks. Comput. Optim. Appl. 45(1): 143-158 (2010)<ref name ='publications"/>
*Giacomo Nannicini, Philippe Baptiste, Gilles Barbier, Daniel Krob, Leo Liberti: Fast paths in large-scale dynamic road networks. Comput. Optim. Appl. 45(1): 143-158 (2010)<ref>{{Cite journal |last=Nannicini |first=Giacomo |last2=Baptiste |first2=Philippe |last3=Barbier |first3=Gilles |last4=Krob |first4=Daniel |last5=Liberti |first5=Leo |date=2010-01-01 |title=Fast paths in large-scale dynamic road networks |url=https://doi.org/10.1007/s10589-008-9172-y |journal=Computational Optimization and Applications |language=en |volume=45 |issue=1 |pages=143–158 |doi=10.1007/s10589-008-9172-y |issn=1573-2894}}</ref>


*Philippe Baptiste:A note on scheduling identical coupled tasks in logarithmic time. Discret. Appl. Math. 158(5): 583-587 (2010)<ref name ='publications"/>
*Philippe Baptiste:A note on scheduling identical coupled tasks in logarithmic time. Discret. Appl. Math. 158(5): 583-587 (2010)<ref>{{Cite journal |last=Baptiste |first=Philippe |date=2010-03-06 |title=A note on scheduling identical coupled tasks in logarithmic time |url=https://www.sciencedirect.com/science/article/pii/S0166218X09004004 |journal=Discrete Applied Mathematics |language=en |volume=158 |issue=5 |pages=583–587 |doi=10.1016/j.dam.2009.10.012 |issn=0166-218X}}</ref>


*Philippe Baptiste, Ruslan Sadykov: Time-indexed formulations for scheduling chains on a single machine: An application to airborne radars. Eur. J. Oper. Res. 203(2): 476-483 (2010)<ref name ='publications"/>
*Philippe Baptiste, Ruslan Sadykov: Time-indexed formulations for scheduling chains on a single machine: An application to airborne radars. Eur. J. Oper. Res. 203(2): 476-483 (2010)<ref>{{Cite journal |last=Baptiste |first=Philippe |last2=Sadykov |first2=Ruslan |date=2010-06-01 |title=Time-indexed formulations for scheduling chains on a single machine: An application to airborne radars |url=https://www.sciencedirect.com/science/article/pii/S0377221709005347 |journal=European Journal of Operational Research |language=en |volume=203 |issue=2 |pages=476–483 |doi=10.1016/j.ejor.2009.07.037 |issn=0377-2217}}</ref>


*Philippe Baptiste, Federico Della Croce, Andrea Grosso, Vincent T'kindt: Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances. J. Sched. 13(1): 39-47 (2010)<ref name ='publications"/>
*Philippe Baptiste, Federico Della Croce, Andrea Grosso, Vincent T'kindt: Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances. J. Sched. 13(1): 39-47 (2010)<ref>{{Cite journal |last=Baptiste |first=P. |last2=Della Croce |first2=F. |last3=Grosso |first3=A. |last4=T’kindt |first4=V. |date=2010-02-01 |title=Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances |url=https://doi.org/10.1007/s10951-008-0092-6 |journal=Journal of Scheduling |language=en |volume=13 |issue=1 |pages=39–47 |doi=10.1007/s10951-008-0092-6 |issn=1099-1425}}</ref>


*Marek Chrobak, Philippe Baptiste, Christoph Dürr:Polynomial Time Algorithms for Minimum Energy Scheduling. Scheduling 2010<ref>{{Cite journal |last=Chrobak |first=Marek |last2=Baptiste |first2=Philippe |last3=Dürr |first3=Christoph |date=2010 |editor-last=Albers |editor-first=Susanne |editor2-last=Baruah |editor2-first=Sanjoy K. |editor3-last=Möhring |editor3-first=Rolf H. |editor4-last=Pruhs |editor4-first=Kirk |title=Polynomial Time Algorithms for Minimum Energy Scheduling |url=https://drops.dagstuhl.de/opus/volltexte/2010/2535 |journal=Scheduling |series=Dagstuhl Seminar Proceedings (DagSemProc) |location=Dagstuhl, Germany |publisher=Schloss Dagstuhl – Leibniz-Zentrum für Informatik |volume=10071 |pages=1–12 |doi=10.4230/DagSemProc.10071.8}}</ref>
*Marek Chrobak, Philippe Baptiste, Christoph Dürr:Polynomial Time Algorithms for Minimum Energy Scheduling. Scheduling 2010 <ref name ='publications"/>
===1999-2009===
===1999-2009===
====2009====
====2009====
*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. Discret. Appl. Math. 157(17): 3656-3664 (2009)<ref name ='publications"/>
*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. Discret. Appl. Math. 157(17): 3656-3664 (2009)<ref>{{Cite journal |last=Meng-Gérard |first=J. |last2=Chrétienne |first2=P. |last3=Baptiste |first3=P. |last4=Sourd |first4=F. |date=2009-10-28 |title=On maximizing the profit of a satellite launcher: Selecting and scheduling tasks with time windows and setups |url=https://www.sciencedirect.com/science/article/pii/S0166218X09000572 |journal=Discrete Applied Mathematics |series=Sixth International Conference on Graphs and Optimization 2007 |language=en |volume=157 |issue=17 |pages=3656–3664 |doi=10.1016/j.dam.2009.02.018 |issn=0166-218X}}</ref>


*Philippe Baptiste, Graham Kendall, Alix Munier, Francis Sourd: Preface. J. Sched. 12(6): 563-564 (2009)<ref name ='publications"/>
*Philippe Baptiste, Graham Kendall, Alix Munier, Francis Sourd: Preface. J. Sched. 12(6): 563-564 (2009)<ref>{{Cite journal |last=Baptiste |first=Philippe |last2=Kendall |first2=Graham |last3=Munier |first3=Alix |last4=Sourd |first4=Francis |date=2009-10-16 |title=Preface |url=https://doi.org/10.1007/s10951-009-0136-6 |journal=Journal of Scheduling |language=en |volume=12 |issue=6 |pages=563 |doi=10.1007/s10951-009-0136-6 |issn=1099-1425}}</ref>


*Philippe Baptiste: Constraint-Based Schedulers, Do They Really Work? CP 2009: 1 <ref>{{Citation |last=Baptiste |first=Philippe |title=Constraint-Based Schedulers, Do They Really Work? |date=2009 |url=http://link.springer.com/10.1007/978-3-642-04244-7_1 |work=Principles and Practice of Constraint Programming - CP 2009 |volume=5732 |pages=1–1 |editor-last=Gent |editor-first=Ian P. |place=Berlin, Heidelberg |publisher=Springer Berlin Heidelberg |language=en |doi=10.1007/978-3-642-04244-7_1 |isbn=978-3-642-04243-0 |access-date=2022-08-10}}</ref>
*Philippe Baptiste: Constraint-Based Schedulers, Do They Really Work? CP 2009: 1<ref name ='publications"/>


*Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko: Integrality Property in Preemptive Parallel Machine Scheduling. CSR 2009: 38-46<ref name ='publications"/>
*Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko: Integrality Property in Preemptive Parallel Machine Scheduling. CSR 2009: 38-46<ref>{{Cite journal |last=Baptiste |first=Philippe |last2=Carlier |first2=Jacques |last3=Kononov |first3=Alexander |last4=Queyranne |first4=Maurice |last5=Sevastyanov |first5=Sergey |last6=Sviridenko |first6=Maxim |date=2009 |editor-last=Frid |editor-first=Anna |editor2-last=Morozov |editor2-first=Andrey |editor3-last=Rybalchenko |editor3-first=Andrey |editor4-last=Wagner |editor4-first=Klaus W. |title=Integrality Property in Preemptive Parallel Machine Scheduling |url=https://link.springer.com/chapter/10.1007/978-3-642-03351-3_6 |journal=Computer Science - Theory and Applications |language=en |location=Berlin, Heidelberg |publisher=Springer |pages=38–46 |doi=10.1007/978-3-642-03351-3_6 |isbn=978-3-642-03351-3}}</ref>


*Philippe Baptiste, Marek Chrobak, Christoph Dürr: Polynomial Time Algorithms for Minimum Energy Scheduling. CoRR abs/0908.3505 (2009)<ref name ='publications"/>
*Philippe Baptiste, Marek Chrobak, Christoph Dürr: Polynomial Time Algorithms for Minimum Energy Scheduling. CoRR abs/0908.3505 (2009)<ref>{{Cite journal |last=Baptiste |first=Philippe |last2=Chrobak |first2=Marek |last3=Durr |first3=Christoph |date=2010-09-03 |title=Polynomial Time Algorithms for Minimum Energy Scheduling |url=http://arxiv.org/abs/0908.3505 |journal=arXiv:0908.3505 [cs]}}</ref>
====2008====
====2008====
*Philippe Baptiste, Marta Flamini, Francis Sourd: Lagrangian bounds for just-in-time job-shop scheduling. Comput. Oper. Res. 35(3): 906-915 (2008)<ref name ='publications"/>
*Philippe Baptiste, Marta Flamini, Francis Sourd: Lagrangian bounds for just-in-time job-shop scheduling. Comput. Oper. Res. 35(3): 906-915 (2008)<ref>{{Cite journal |last=Baptiste |first=Philippe |last2=Flamini |first2=Marta |last3=Sourd |first3=Francis |date=2008-03-01 |title=Lagrangian bounds for just-in-time job-shop scheduling |url=https://www.sciencedirect.com/science/article/pii/S0305054806001389 |journal=Computers & Operations Research |series=Part Special Issue: New Trends in Locational Analysis |language=en |volume=35 |issue=3 |pages=906–915 |doi=10.1016/j.cor.2006.05.009 |issn=0305-0548}}</ref>


*Antoine Jouglet, David Savourey, Jacques Carlier, Philippe Baptiste: Dominance-based heuristics for one-machine total cost scheduling problems. Eur. J. Oper. Res. 184(3): 879-899 (2008)<ref name ='publications"/>
*Antoine Jouglet, David Savourey, Jacques Carlier, Philippe Baptiste: Dominance-based heuristics for one-machine total cost scheduling problems. Eur. J. Oper. Res. 184(3): 879-899 (2008)<ref>{{Cite journal |last=Jouglet |first=Antoine |last2=Savourey |first2=David |last3=Carlier |first3=Jacques |last4=Baptiste |first4=Philippe |date=2008-02-01 |title=Dominance-based heuristics for one-machine total cost scheduling problems |url=https://www.sciencedirect.com/science/article/pii/S0377221706012367 |journal=European Journal of Operational Research |language=en |volume=184 |issue=3 |pages=879–899 |doi=10.1016/j.ejor.2006.11.036 |issn=0377-2217}}</ref>


*Konstantin Artiouchine, Philippe Baptiste, Christoph Dürr: Runway sequencing with holding patterns. Eur. J. Oper. Res. 189(3): 1254-1266 (2008)<ref name ='publications"/>
*Konstantin Artiouchine, Philippe Baptiste, Christoph Dürr: Runway sequencing with holding patterns. Eur. J. Oper. Res. 189(3): 1254-1266 (2008)<ref>{{Cite journal |last=Artiouchine |first=Konstantin |last2=Baptiste |first2=Philippe |last3=Dürr |first3=Christoph |date=2008-09-16 |title=Runway sequencing with holding patterns |url=https://www.sciencedirect.com/science/article/pii/S0377221707005978 |journal=European Journal of Operational Research |language=en |volume=189 |issue=3 |pages=1254–1266 |doi=10.1016/j.ejor.2006.06.076 |issn=0377-2217}}</ref>


*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 J. Comput. 20(2): 222-233 (2008)<ref name ='publications"/>
*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 J. Comput. 20(2): 222-233 (2008)<ref>{{Cite journal |last=Artiouchine |first=Konstantin |last2=Baptiste |first2=Philippe |last3=Mattioli |first3=Juliette |date=2008-05-01 |title=The K King Problem, an Abstract Model for Computing Aircraft Landing Trajectories: On Modeling a Dynamic Hybrid System with Constraints |url=https://pubsonline.informs.org/doi/10.1287/ijoc.1070.0234 |journal=INFORMS Journal on Computing |volume=20 |issue=2 |pages=222–233 |doi=10.1287/ijoc.1070.0234 |issn=1091-9856}}</ref>


*Giacomo Nannicini, Philippe Baptiste, Daniel Krob, Leo Liberti: Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks. COCOA 2008: 225-234<ref name ='publications"/>
*Giacomo Nannicini, Philippe Baptiste, Daniel Krob, Leo Liberti: Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks. COCOA 2008: 225-234<ref>{{Cite journal |last=Nannicini |first=Giacomo |last2=Baptiste |first2=Philippe |last3=Krob |first3=Daniel |last4=Liberti |first4=Leo |date=2008 |editor-last=Yang |editor-first=Boting |editor2-last=Du |editor2-first=Ding-Zhu |editor3-last=Wang |editor3-first=Cao An |title=Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks |url=https://link.springer.com/chapter/10.1007/978-3-540-85097-7_21 |journal=Combinatorial Optimization and Applications |language=en |location=Berlin, Heidelberg |publisher=Springer |pages=225–234 |doi=10.1007/978-3-540-85097-7_21 |isbn=978-3-540-85097-7}}</ref>
====2007====
====2007====
*Konstantin Artiouchine, Philippe Baptiste: Arc-B-consistency of the Inter-distance Constraint. Constraints An Int. J. 12(1): 3-19 (2007)<ref name ='publications"/>
*Konstantin Artiouchine, Philippe Baptiste: Arc-B-consistency of the Inter-distance Constraint. Constraints An Int. J. 12(1): 3-19 (2007)<ref>{{Cite journal |last=Artiouchine |first=Konstantin |last2=Baptiste |first2=Philippe |date=2007-03-01 |title=Arc-B-consistency of the Inter-distance Constraint |url=https://doi.org/10.1007/s10601-006-9009-1 |journal=Constraints |language=en |volume=12 |issue=1 |pages=3–19 |doi=10.1007/s10601-006-9009-1 |issn=1572-9354}}</ref>


*Philippe Baptiste: Book review. Oper. Res. Lett. 35(1): 139-140 (2007)<ref name ='publications"/>
*Philippe Baptiste: Book review. Oper. Res. Lett. 35(1): 139-140 (2007)<ref>{{Cite journal |last=Baptiste |first=Philippe |date=2007-01-01 |title=Book review |url=https://www.sciencedirect.com/science/article/pii/S0167637706000083 |journal=Operations Research Letters |language=en |volume=35 |issue=1 |pages=139–140 |doi=10.1016/j.orl.2006.01.001 |issn=0167-6377}}</ref>


*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. Sched. 10(2): 139-146 (2007)<ref name ='publications"/>
*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. Sched. 10(2): 139-146 (2007)<ref>{{Cite journal |last=Baptiste |first=Philippe |last2=Brucker |first2=Peter |last3=Chrobak |first3=Marek |last4=Dürr |first4=Christoph |last5=Kravchenko |first5=Svetlana A. |last6=Sourd |first6=Francis |date=2007-04-01 |title=The complexity of mean flow time scheduling problems with release times |url=https://doi.org/10.1007/s10951-006-0006-4 |journal=Journal of Scheduling |language=en |volume=10 |issue=2 |pages=139–146 |doi=10.1007/s10951-006-0006-4 |issn=1099-1425}}</ref>


*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<ref name ='publications"/>
*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<ref>{{Cite journal |last=Nannicini |first=Giacomo |last2=Baptiste |first2=Philippe |last3=Barbier |first3=Gilles |last4=Krob |first4=Daniel |last5=Liberti |first5=Leo |date=2007-06-27 |title=Fast paths in large-scale dynamic road networks |url=http://arxiv.org/abs/0704.1068 |journal=arXiv:0704.1068 [cs]}}</ref>


*Philippe Baptiste, Marek Chrobak, Christoph Dürr: Polynomial Time Algorithms for Minimum Energy Scheduling. ESA 2007: 136-150<ref>{{Cite journal |last=Baptiste |first=Philippe |last2=Chrobak |first2=Marek |last3=Dürr |first3=Christoph |date=2007 |editor-last=Arge |editor-first=Lars |editor2-last=Hoffmann |editor2-first=Michael |editor3-last=Welzl |editor3-first=Emo |title=Polynomial Time Algorithms for Minimum Energy Scheduling |url=https://link.springer.com/chapter/10.1007/978-3-540-75520-3_14 |journal=Algorithms – ESA 2007 |language=en |location=Berlin, Heidelberg |publisher=Springer |pages=136–150 |doi=10.1007/978-3-540-75520-3_14 |isbn=978-3-540-75520-3}}</ref>
*Philippe Baptiste, Marek Chrobak, Christoph Dürr: Polynomial Time Algorithms for Minimum Energy Scheduling. ESA 2007: 136-150<ref name ='publications"/>


*Giacomo Nannicini, Philippe Baptiste, Gilles Barbier, Daniel Krob, Leo Liberti: Fast paths in large-scale dynamic road networks. CoRR abs/0704.1068 (2007)<ref name ='publications"/>
*Giacomo Nannicini, Philippe Baptiste, Gilles Barbier, Daniel Krob, Leo Liberti: Fast paths in large-scale dynamic road networks. CoRR abs/0704.1068 (2007)<ref>{{Cite journal |last=Nannicini |first=Giacomo |last2=Baptiste |first2=Philippe |last3=Barbier |first3=Gilles |last4=Krob |first4=Daniel |last5=Liberti |first5=Leo |date=2007-06-27 |title=Fast paths in large-scale dynamic road networks |url=http://arxiv.org/abs/0704.1068 |journal=arXiv:0704.1068 [cs]}}</ref>
====2006====
====2006====
*David Savourey, Philippe Baptiste, Antoine Jouglet: Lower bounds for parallel machines scheduling. RIVF 2006: 195-198<ref name ='publications"/>
*David Savourey, Philippe Baptiste, Antoine Jouglet: Lower bounds for parallel machines scheduling. RIVF 2006: 195-198<ref>{{Cite journal |last=Savourey |first=D. |last2=Baptiste |first2=P. |last3=Jouglet |first3=A. |date=2006-02 |title=Lower bounds for parallel machines scheduling |url=https://ieeexplore.ieee.org/document/1696437 |journal=2006 International Conference onResearch, Innovation and Vision for the Future |pages=195–198 |doi=10.1109/RIVF.2006.1696437}}</ref>


*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<ref name ='publications"/>
*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<ref>{{Cite journal |last=Baptiste |first=Philippe |date=2006-01-22 |title=Scheduling unit tasks to minimize the number of idle periods: a polynomial time algorithm for offline dynamic power management |url=https://dl.acm.org/doi/10.5555/1109557.1109598 |journal=Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm |series=SODA '06 |location=USA |publisher=Society for Industrial and Applied Mathematics |pages=364–367 |doi=10.5555/1109557.1109598 |isbn=978-0-89871-605-4}}</ref>


*Philippe Baptiste, Philippe Laborie, Claude Le Pape, Wim Nuijten: Constraint-Based Scheduling and Planning. Handbook of Constraint Programming 2006: 761-799<ref name ='publications"/>
*Philippe Baptiste, Philippe Laborie, Claude Le Pape, Wim Nuijten: Constraint-Based Scheduling and Planning. Handbook of Constraint Programming 2006: 761-799<ref>{{Citation |last=Baptiste |first=Philippe |title=Chapter 22 - Constraint-Based Scheduling and Planning |date=2006-01-01 |url=https://www.sciencedirect.com/science/article/pii/S157465260680026X |work=Foundations of Artificial Intelligence |volume=2 |pages=761–799 |editor-last=Rossi |editor-first=Francesca |series=Handbook of Constraint Programming |publisher=Elsevier |language=en |access-date=2022-08-10 |last2=Laborie |first2=Philippe |last3=Pape |first3=Claude Le |last4=Nuijten |first4=Wim |editor2-last=van Beek |editor2-first=Peter |editor3-last=Walsh |editor3-first=Toby}}</ref>


*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)<ref name ='publications"/>
*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)<ref>{{Cite journal |last=Baptiste |first=Philippe |last2=Brucker |first2=Peter |last3=Chrobak |first3=Marek |last4=Durr |first4=Christoph |last5=Kravchenko |first5=Svetlana A. |last6=Sourd |first6=Francis |date=2006-05-17 |title=The Complexity of Mean Flow Time Scheduling Problems with Release Times |url=http://arxiv.org/abs/cs/0605078 |journal=arXiv:cs/0605078}}</ref>
====2005====
====2005====
*Philippe Baptiste, Claude Le Pape: Scheduling a single machine to minimize a regular objective function under setup constraints. Discret. Optim. 2(1): 83-99 (2005)<ref name ='publications"/>
*Philippe Baptiste, Claude Le Pape: Scheduling a single machine to minimize a regular objective function under setup constraints. Discret. Optim. 2(1): 83-99 (2005)<ref>{{Cite journal |last=Baptiste |first=Philippe |last2=Le Pape |first2=Claude |date=2005-03-30 |title=Scheduling a single machine to minimize a regular objective function under setup constraints |url=https://www.sciencedirect.com/science/article/pii/S157252860500006X |journal=Discrete Optimization |language=en |volume=2 |issue=1 |pages=83–99 |doi=10.1016/j.disopt.2004.12.003 |issn=1572-5286}}</ref>


*Huy Trandac, Philippe Baptiste, Vu Duong: Airspace sectorization with constraints. RAIRO Oper. Res. 39(2): 105-122 (2005)<ref name ='publications"/>
*Huy Trandac, Philippe Baptiste, Vu Duong: Airspace sectorization with constraints. RAIRO Oper. Res. 39(2): 105-122 (2005)<ref>{{Cite journal |last=Trandac |first=Huy |last2=Baptiste |first2=Philippe |last3=Duong |first3=Vu |date=2005-04-01 |title=Airspace sectorization with constraints |url=https://www.rairo-ro.org/articles/ro/abs/2005/02/ro0301/ro0301.html |journal=RAIRO - Operations Research |language=en |volume=39 |issue=2 |pages=105–122 |doi=10.1051/ro:2005005 |issn=0399-0559}}</ref>


*Konstantin Artiouchine, Philippe Baptiste:Inter-distance Constraint: An Extension of the All-Different Constraint for Scheduling Equal Length Jobs. CP 2005: 62-76<ref name ='publications"/>
*Konstantin Artiouchine, Philippe Baptiste:Inter-distance Constraint: An Extension of the All-Different Constraint for Scheduling Equal Length Jobs. CP 2005: 62-76<ref>{{Cite journal |last=Artiouchine |first=Konstantin |last2=Baptiste |first2=Philippe |date=2005 |editor-last=van Beek |editor-first=Peter |title=Inter-distance Constraint: An Extension of the All-Different Constraint for Scheduling Equal Length Jobs |url=https://link.springer.com/chapter/10.1007/11564751_8 |journal=Principles and Practice of Constraint Programming - CP 2005 |language=en |location=Berlin, Heidelberg |publisher=Springer |pages=62–76 |doi=10.1007/11564751_8 |isbn=978-3-540-32050-0}}</ref>
====2004====
====2004====
*Philippe Baptiste, Peter Brucker, Sigrid Knust, Vadim G. Timkovsky: Ten notes on equal-processing-time scheduling. 4OR 2(2): 111-127 (2004)<ref name ='publications"/>
*Philippe Baptiste, Peter Brucker, Sigrid Knust, Vadim G. Timkovsky: Ten notes on equal-processing-time scheduling. 4OR 2(2): 111-127 (2004)<ref>{{Cite journal |last=Baptiste |first=Philippe |last2=Brucker |first2=Peter |last3=Knust |first3=Sigrid |last4=Timkovsky |first4=Vadim G. |date=2004-07-01 |title=Ten notes on equal-processing-time scheduling |url=https://doi.org/10.1007/s10288-003-0024-4 |journal=Quarterly Journal of the Belgian, French and Italian Operations Research Societies |language=en |volume=2 |issue=2 |pages=111–127 |doi=10.1007/s10288-003-0024-4 |issn=1619-4500}}</ref>


*Philippe Baptiste, Jacques Carlier, Alix Munier, Andreas S. Schulz: Introduction. Ann. Oper. Res. 129(1-4): 17-19 (2004)<ref name ='publications"/>
*Philippe Baptiste, Jacques Carlier, Alix Munier, Andreas S. Schulz: Introduction. Ann. Oper. Res. 129(1-4): 17-19 (2004)<ref>{{Cite journal |last=Baptiste |first=Philippe |last2=Carlier |first2=Jacques |last3=Munier |first3=Alix |last4=Schulz |first4=Andreas |date=2004-07 |title=Introduction |url=http://link.springer.com/10.1023/B:ANOR.0000030779.01529.d2 |journal=Annals of Operations Research |language=en |volume=129 |issue=1-4 |pages=17–19 |doi=10.1023/B:ANOR.0000030779.01529.d2 |issn=0254-5330}}</ref>


*Philippe Baptiste, Jacques Carlier, Antoine Jouglet: A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates. Eur. J. Oper. Res. 158(3): 595-608(2004)<ref name ='publications"/>
*Philippe Baptiste, Jacques Carlier, Antoine Jouglet: A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates. Eur. J. Oper. Res. 158(3): 595-608(2004)<ref>{{Cite journal |last=Baptiste |first=Philippe |last2=Carlier |first2=Jacques |last3=Jouglet |first3=Antoine |date=2004-11-01 |title=A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates |url=https://www.sciencedirect.com/science/article/pii/S0377221703003783 |journal=European Journal of Operational Research |language=en |volume=158 |issue=3 |pages=595–608 |doi=10.1016/S0377-2217(03)00378-3 |issn=0377-2217}}</ref>


*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. Methods Oper. Res. 60(1): 145-153 (2004)<ref name ='publications"/>
*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. Methods Oper. Res. 60(1): 145-153 (2004)<ref>{{Cite journal |last=Baptiste |first=Philippe |last2=Timkovsky |first2=Vadim G. |date=2004-09-01 |title=Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time |url=https://doi.org/10.1007/s001860300336 |journal=Mathematical Methods of Operations Research |language=en |volume=60 |issue=1 |pages=145–153 |doi=10.1007/s001860300336 |issn=1432-5217}}</ref>


*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)<ref name ='publications"/>
*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)<ref>{{Cite journal |last=Baptiste |first=Philippe |last2=Chrobak |first2=Marek |last3=Dürr |first3=Christoph |last4=Jawor |first4=Wojciech |last5=Vakhania |first5=Nodari |date=2004-05-01 |title=Preemptive scheduling of equal-length jobs to maximize weighted throughput |url=https://www.sciencedirect.com/science/article/pii/S0167637703001238 |journal=Operations Research Letters |language=en |volume=32 |issue=3 |pages=258–264 |doi=10.1016/j.orl.2003.09.004 |issn=0167-6377}}</ref>


*Philippe Baptiste, Sophie Demassey: Tight LP bounds for resource constrained project scheduling. OR Spectr. 26(2): 251-262 (2004)<ref name ='publications"/>
*Philippe Baptiste, Sophie Demassey: Tight LP bounds for resource constrained project scheduling. OR Spectr. 26(2): 251-262 (2004)<ref>{{Cite journal |last=Baptiste |first=Philippe |last2=Demassey |first2=Sophie |date=2004-03-01 |title=Tight LP bounds for resource constrained project scheduling |url=https://doi.org/10.1007/s00291-003-0155-1 |journal=OR Spectrum |language=en |volume=26 |issue=2 |pages=251–262 |doi=10.1007/s00291-003-0155-1 |issn=1436-6304}}</ref>


*Dac-Huy Tran, Philippe Baptiste, Vu Duong: From Sets to Geometrical Sectors in the Airspace Sectorization Problem. RIVF 2004: 7-10<ref name ='publications"/>
*Dac-Huy Tran, Philippe Baptiste, Vu Duong: From Sets to Geometrical Sectors in the Airspace Sectorization Problem. RIVF 2004: 7-10<ref>{{Cite web |title=Wayback Machine |url=https://web.archive.org/web/20220000000000*/http://e-ifi.org/rivf/2004/proceedings/ArticlesRIVR_04/p07-10.pdf |access-date=2022-08-10 |website=web.archive.org}}</ref>


*Philippe Baptiste, Peter Brucker: Scheduling Equal Processing Time Jobs. Handbook of Scheduling 2004<ref name ='publications"/>
*Philippe Baptiste, Peter Brucker: Scheduling Equal Processing Time Jobs. Handbook of Scheduling 2004<ref name ='publications"/>
Line 108: Line 108:
*Antoine Jouglet, Philippe Baptiste, Jacques Carlier: Branch-and-Bound Algorithms for TotalWeighted Tardiness. Handbook of Scheduling 2004<ref name ='publications"/>
*Antoine Jouglet, Philippe Baptiste, Jacques Carlier: Branch-and-Bound Algorithms for TotalWeighted Tardiness. Handbook of Scheduling 2004<ref name ='publications"/>


*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)<ref name ='publications"/>
*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)<ref>{{Cite journal |last=Baptiste |first=Philippe |last2=Chrobak |first2=Marek |last3=Durr |first3=Christoph |last4=Sourd |first4=Francis |date=2004-12-20 |title=Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time |url=http://arxiv.org/abs/cs/0412094 |journal=arXiv:cs/0412094}}</ref>
====2003====
====2003====
*Philippe Baptiste: A note on scheduling multiprocessor tasks with identical processing times. Comput. Oper. Res. 30(13): 2071-2078 (2003)<ref name ='publications"/>
*Philippe Baptiste: A note on scheduling multiprocessor tasks with identical processing times. Comput. Oper. Res. 30(13): 2071-2078 (2003)<ref>{{Cite journal |last=Baptiste |first=Philippe |date=2003-11-01 |title=A note on scheduling multiprocessor tasks with identical processing times |url=https://www.sciencedirect.com/science/article/pii/S0305054802001168 |journal=Computers & Operations Research |language=en |volume=30 |issue=13 |pages=2071–2078 |doi=10.1016/S0305-0548(02)00116-8 |issn=0305-0548}}</ref>


*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. Eur. J. Oper. Res. 144(1): 1-11(2003)<ref name ='publications"/>
*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. Eur. J. Oper. Res. 144(1): 1-11(2003)<ref>{{Cite journal |last=Baptiste |first=Philippe |last2=Peridy |first2=Laurent |last3=Pinson |first3=Eric |date=2003-01-01 |title=A branch and bound to minimize the number of late jobs on a single machine with release time constraints |url=https://www.sciencedirect.com/science/article/pii/S0377221701003538 |journal=European Journal of Operational Research |language=en |volume=144 |issue=1 |pages=1–11 |doi=10.1016/S0377-2217(01)00353-8 |issn=0377-2217}}</ref>


*Philippe Baptiste: On minimizing the weighted number of late jobs in unit execution time open-shops. Eur. J. Oper. Res. 149(2): 344-354 (2003)<ref name ='publications"/>
*Philippe Baptiste: On minimizing the weighted number of late jobs in unit execution time open-shops. Eur. J. Oper. Res. 149(2): 344-354 (2003)<ref>{{Cite journal |last=Baptiste |first=Philippe |date=2003-09-01 |title=On minimizing the weighted number of late jobs in unit execution time open-shops |url=https://www.sciencedirect.com/science/article/pii/S0377221702007592 |journal=European Journal of Operational Research |series=Sequencing and Scheduling |language=en |volume=149 |issue=2 |pages=344–354 |doi=10.1016/S0377-2217(02)00759-2 |issn=0377-2217}}</ref>


*Philippe Baptiste, Baruch Schieber: A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness. J. Sched. 6(4): 395-404 (2003)<ref name ='publications"/>
*Philippe Baptiste, Baruch Schieber: A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness. J. Sched. 6(4): 395-404 (2003)<ref>{{Cite journal |last=Baptiste |first=Philippe |last2=Schieber |first2=Baruch |date=2003-07-01 |title=A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness |url=https://doi.org/10.1023/A:1024012811536 |journal=Journal of Scheduling |language=en |volume=6 |issue=4 |pages=395–404 |doi=10.1023/A:1024012811536 |issn=1099-1425}}</ref>


*Huy Trandac, Philippe Baptiste, Vu Duong: Airspace Sectorization By Constraint Programming. RIVF 2003: 49-58<ref name ='publications"/>
*Huy Trandac, Philippe Baptiste, Vu Duong: Airspace Sectorization By Constraint Programming. RIVF 2003: 49-58<ref>{{Cite web |title=Wayback Machine |url=https://web.archive.org/web/20220000000000*/http://www.e-ifi.org/rivf2003/proceedings/p49-58.pdf |access-date=2022-08-10 |website=web.archive.org}}</ref>
====2002====
====2002====
*Philippe Baptiste: Résultats de complexité et programmation par contraintes pour l'ordonnancement. University of Technology of Compiègne, France, 2002<ref name ='publications"/>
*Philippe Baptiste: Résultats de complexité et programmation par contraintes pour l'ordonnancement. University of Technology of Compiègne, France, 2002<ref>{{Cite thesis |title=Résultats de complexité et programmation par contraintes pour l'ordonnancement |url=https://tel.archives-ouvertes.fr/tel-00124998 |publisher=Université de Technologie de Compiègne |date=2002-07-01 |degree=thesis |language=en |first=Philippe |last=Baptiste}}</ref>


*Antoine Jouglet, Philippe Baptiste, Jacques Carlier: Exact procedures for single machine total cost scheduling. SMC 2002: 4<ref name ='publications"/>
*Antoine Jouglet, Philippe Baptiste, Jacques Carlier: Exact procedures for single machine total cost scheduling. SMC 2002: 4<ref>{{Cite journal |last=Jouglet |first=A. |last2=Baptiste |first2=P. |last3=Carlier |first3=J. |date=2002-10 |title=Exact procedures for single machine total cost scheduling |url=https://ieeexplore.ieee.org/document/1175623 |journal=IEEE International Conference on Systems, Man and Cybernetics |volume=6 |pages=4 pp. vol.6– |doi=10.1109/ICSMC.2002.1175623}}</ref>


*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)<ref name ='publications"/>
*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)<ref>{{Cite journal |last=Baptiste |first=Philippe |last2=Chrobak |first2=Marek |last3=Durr |first3=Christoph |last4=Jawor |first4=Wojciech |last5=Vakhania |first5=Nodari |date=2003-03-11 |title=Preemptive Scheduling of Equal-Length Jobs to Maximize Weighted Throughput |url=http://arxiv.org/abs/cs/0209033 |journal=arXiv:cs/0209033}}</ref>
====2001====
====2001====
*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)<ref name ='publications"/>
*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)<ref>{{Cite journal |last=Baptiste |first=Philippe |last2=Timkovsky |first2=Vadim G. |date=2001-06-01 |title=On preemption redundancy in scheduling unit processing time jobs on two parallel machines |url=https://www.sciencedirect.com/science/article/pii/S0167637701000682 |journal=Operations Research Letters |language=en |volume=28 |issue=5 |pages=205–212 |doi=10.1016/S0167-6377(01)00068-2 |issn=0167-6377}}</ref>


*Philippe Baptiste, Antoine Jouglet: On Minimizing Total Tardiness in a Serial Batching Problem. RAIRO Oper. Res. 35(1): 107-115 (2001)<ref name ='publications"/>
*Philippe Baptiste, Antoine Jouglet: On Minimizing Total Tardiness in a Serial Batching Problem. RAIRO Oper. Res. 35(1): 107-115 (2001)<ref>{{Cite journal |last=Baptiste |first=Philippe |last2=Jouglet |first2=Antoine |date=2001-01-01 |title=On Minimizing Total Tardiness in a Serial Batching Problem |url=https://www.rairo-ro.org/articles/ro/abs/2001/01/ro2118/ro2118.html |journal=RAIRO - Operations Research |language=en |volume=35 |issue=1 |pages=107–115 |doi=10.1051/ro:2001105 |issn=0399-0559}}</ref>


*Philippe Baptiste, Vadim G. Timkovsky: On preemption redundancy in scheduling unit processing time jobs on two parallel machines. IPDPS 2001: 200<ref name ='publications"/>
*Philippe Baptiste, Vadim G. Timkovsky: On preemption redundancy in scheduling unit processing time jobs on two parallel machines. IPDPS 2001: 200<ref>{{Cite journal |last=Baptiste |first=P. |last2=Timkovsky |first2=V.G. |date=2001-04 |title=On preemption redundancy in scheduling unit processing time jobs on two parallel machines |url=https://ieeexplore.ieee.org/document/925215 |journal=Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001 |pages=2152–2156 |doi=10.1109/IPDPS.2001.925215}}</ref>
====2000====
====2000====
*Philippe Baptiste, Claude Le Pape: Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems. Constraints An Int. J. 5(1/2): 119-139 (2000)<ref name ='publications"/>
*Philippe Baptiste, Claude Le Pape: Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems. Constraints An Int. J. 5(1/2): 119-139 (2000)<ref>{{Cite journal |last=Baptiste |first=Philippe |last2=Pape |first2=Claude Le |date=2000-01-01 |title=Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems |url=https://doi.org/10.1023/A:1009822502231 |journal=Constraints |language=en |volume=5 |issue=1 |pages=119–139 |doi=10.1023/A:1009822502231 |issn=1572-9354}}</ref>


*Philippe Baptiste: Scheduling equal-length jobs on identical parallel machines. Discret. Appl. Math. 103(1-3): 21-32 (2000)<ref name ='publications"/>
*Philippe Baptiste: Scheduling equal-length jobs on identical parallel machines. Discret. Appl. Math. 103(1-3): 21-32 (2000)<ref>{{Cite journal |last=Baptiste |first=Philippe |date=2000-07-15 |title=Scheduling equal-length jobs on identical parallel machines |url=https://www.sciencedirect.com/science/article/pii/S0166218X99002383 |journal=Discrete Applied Mathematics |language=en |volume=103 |issue=1 |pages=21–32 |doi=10.1016/S0166-218X(99)00238-3 |issn=0166-218X}}</ref>


*Philippe Baptiste: Batching identical jobs. Math. Methods Oper. Res. 52(3): 355-367 (2000)<ref name ='publications"/>
*Philippe Baptiste: Batching identical jobs. Math. Methods Oper. Res. 52(3): 355-367 (2000)<ref>{{Cite journal |last=Baptiste |first=Philippe |date=2000-12-01 |title=Batching identical jobs |url=https://doi.org/10.1007/s001860000088 |journal=Mathematical Methods of Operations Research |language=en |volume=52 |issue=3 |pages=355–367 |doi=10.1007/s001860000088 |issn=1432-5217}}</ref>
===1990 – 1999===
===1990 – 1999===
====1999====
====1999====
*Philippe Baptiste, Claude Le Pape, Wim Nuijten: Satisfiability tests and time‐bound adjustmentsfor cumulative scheduling problems. Ann. Oper. Res. 92: 305-333 (1999)<ref name ='publications"/>
*Philippe Baptiste, Claude Le Pape, Wim Nuijten: Satisfiability tests and time‐bound adjustmentsfor cumulative scheduling problems. Ann. Oper. Res. 92: 305-333 (1999)<ref>{{Cite journal |last=Baptiste |first=Ph. |last2=Le Pape |first2=C. |last3=Nuijten |first3=W. |date=1999-01-01 |title=Satisfiability tests and time‐bound adjustmentsfor cumulative scheduling problems |url=https://doi.org/10.1023/A:1018995000688 |journal=Annals of Operations Research |language=en |volume=92 |issue=0 |pages=305–333 |doi=10.1023/A:1018995000688 |issn=1572-9338}}</ref>


*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)<ref name ='publications"/>
*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)<ref>{{Cite journal |last=Pape |first=Claude Le |last2=Baptiste |first2=Philippe |date=1999-10-01 |title=Heuristic Control of a Constraint-Based Algorithm for the Preemptive Job-Shop Scheduling Problem |url=https://doi.org/10.1023/A:1009613717770 |journal=Journal of Heuristics |language=en |volume=5 |issue=3 |pages=305–325 |doi=10.1023/A:1009613717770 |issn=1572-9397}}</ref>


*Philippe Baptiste: An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Oper. Res. Lett. 24(4): 175-180 (1999)<ref name ='publications"/>
*Philippe Baptiste: An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Oper. Res. Lett. 24(4): 175-180 (1999)<ref>{{Cite journal |last=Baptiste |first=Philippe |date=1999-05-01 |title=An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs |url=https://www.sciencedirect.com/science/article/pii/S0167637798000455 |journal=Operations Research Letters |language=en |volume=24 |issue=4 |pages=175–180 |doi=10.1016/S0167-6377(98)00045-5 |issn=0167-6377}}</ref>
====1998====
====1998====
*Claude Le Pape, Philippe Baptiste: Resource Constraints for Preemptive Job-shop Scheduling. Constraints An Int. J. 3(4): 263-287 (1998)<ref name ='publications"/>
*Claude Le Pape, Philippe Baptiste: Resource Constraints for Preemptive Job-shop Scheduling. Constraints An Int. J. 3(4): 263-287 (1998)<ref>{{Cite journal |last=Pape |first=Claude Le |last2=Baptiste |first2=Philippe |date=1998-10-01 |title=Resource Constraints for Preemptive Job-shop Scheduling |url=https://doi.org/10.1023/A:1009723704757 |journal=Constraints |language=en |volume=3 |issue=4 |pages=263–287 |doi=10.1023/A:1009723704757 |issn=1572-9354}}</ref>


*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<ref name ='publications"/>
*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<ref>{{Cite journal |last=Baptiste |first=Philippe |last2=Le Pape |first2=Claude |last3=Peridy |first3=Laurent |date=1998 |editor-last=Maher |editor-first=Michael |editor2-last=Puget |editor2-first=Jean-Francois |title=Global Constraints for Partial CSPs: A Case-Study of Resource and Due Date Constraints |url=https://link.springer.com/chapter/10.1007/3-540-49481-2_8 |journal=Principles and Practice of Constraint Programming — CP98 |language=en |location=Berlin, Heidelberg |publisher=Springer |pages=87–101 |doi=10.1007/3-540-49481-2_8 |isbn=978-3-540-49481-2}}</ref>
====1997====
====1997====
*Philippe Baptiste, Claude Le Pape: Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems. CP 1997: 375-389<ref name ='publications"/>
*Philippe Baptiste, Claude Le Pape: Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems. CP 1997: 375-389<ref>{{Cite journal |last=Baptiste |first=Philippe |last2=Le Pape |first2=Claude |date=1997 |editor-last=Smolka |editor-first=Gert |title=Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems |url=https://link.springer.com/chapter/10.1007/BFb0017454 |journal=Principles and Practice of Constraint Programming-CP97 |language=en |location=Berlin, Heidelberg |publisher=Springer |pages=375–389 |doi=10.1007/BFb0017454 |isbn=978-3-540-69642-1}}</ref>
====1996====
====1996====
*Claude Le Pape, Philippe Baptiste:Constraint Propagation Techniques for Disjunctive Scheduling: The Preemptive Case. ECAI 1996: 619-623<ref name ='publications"/>
*Claude Le Pape, Philippe Baptiste:Constraint Propagation Techniques for Disjunctive Scheduling: The Preemptive Case. ECAI 1996: 619-623
====1995====
====1995====
*Philippe Baptiste, Claude Le Pape: A Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling. IJCAI (1) 1995: 600-606<ref name ='publications"/>
*Philippe Baptiste, Claude Le Pape: A Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling. IJCAI (1) 1995: 600-606<ref name ='publications"/>

Revision as of 13:16, 10 August 2022

DR
Philippe Baptiste
BornMarch 28, 1972
Nationality France
Alma materUniversity of Technology of Compiègne, University of Strathclyde, Sorbonne University
Occupation(s)Academician, Civil Engineer, Scientist
TitleCEO 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]

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 serveral 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]

Publications

2010 – 2019

2018

  • Philippe Baptiste, Nicolas Bonifas: Redundant cumulative constraints to compute preemptive bounds. Discret. Appl. Math. 234: 168-177 (2018)[3]

2017

  • Philippe Baptiste, Mikhail Y. Kovalyov, Yury L. Orlovich, Frank Werner, Igor E. Zverovich: Graphs with maximal induced matchings of the same size. Discret. Appl. Math. 216: 15-28 (2017)[4]

2012

  • Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko: Integer preemptive scheduling on parallel machines. Oper. Res. Lett. 40(6): 440-444 (2012)[5]
  • Philippe Baptiste, Marek Chrobak, Christoph Dürr: Polynomial-time algorithms for minimum energy scheduling. ACM Trans. Algorithms 8(3): 26:1-26:29 (2012)[6]

2011

  • Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko: Properties of optimal schedules in preemptive shop scheduling. Discret. Appl. Math. 159(5): 272-280 (2011)[7]

2010

  • Giacomo Nannicini, Philippe Baptiste, Gilles Barbier, Daniel Krob, Leo Liberti: Fast paths in large-scale dynamic road networks. Comput. Optim. Appl. 45(1): 143-158 (2010)[8]
  • Philippe Baptiste:A note on scheduling identical coupled tasks in logarithmic time. Discret. Appl. Math. 158(5): 583-587 (2010)[9]
  • Philippe Baptiste, Ruslan Sadykov: Time-indexed formulations for scheduling chains on a single machine: An application to airborne radars. Eur. J. Oper. Res. 203(2): 476-483 (2010)[10]
  • Philippe Baptiste, Federico Della Croce, Andrea Grosso, Vincent T'kindt: Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances. J. Sched. 13(1): 39-47 (2010)[11]
  • Marek Chrobak, Philippe Baptiste, Christoph Dürr:Polynomial Time Algorithms for Minimum Energy Scheduling. Scheduling 2010[12]

1999-2009

2009

  • 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. Discret. Appl. Math. 157(17): 3656-3664 (2009)[13]
  • Philippe Baptiste, Graham Kendall, Alix Munier, Francis Sourd: Preface. J. Sched. 12(6): 563-564 (2009)[14]
  • Philippe Baptiste: Constraint-Based Schedulers, Do They Really Work? CP 2009: 1 [15]
  • Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko: Integrality Property in Preemptive Parallel Machine Scheduling. CSR 2009: 38-46[16]
  • Philippe Baptiste, Marek Chrobak, Christoph Dürr: Polynomial Time Algorithms for Minimum Energy Scheduling. CoRR abs/0908.3505 (2009)[17]

2008

  • Philippe Baptiste, Marta Flamini, Francis Sourd: Lagrangian bounds for just-in-time job-shop scheduling. Comput. Oper. Res. 35(3): 906-915 (2008)[18]
  • Antoine Jouglet, David Savourey, Jacques Carlier, Philippe Baptiste: Dominance-based heuristics for one-machine total cost scheduling problems. Eur. J. Oper. Res. 184(3): 879-899 (2008)[19]
  • Konstantin Artiouchine, Philippe Baptiste, Christoph Dürr: Runway sequencing with holding patterns. Eur. J. Oper. Res. 189(3): 1254-1266 (2008)[20]
  • 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 J. Comput. 20(2): 222-233 (2008)[21]
  • Giacomo Nannicini, Philippe Baptiste, Daniel Krob, Leo Liberti: Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks. COCOA 2008: 225-234[22]

2007

  • Konstantin Artiouchine, Philippe Baptiste: Arc-B-consistency of the Inter-distance Constraint. Constraints An Int. J. 12(1): 3-19 (2007)[23]
  • Philippe Baptiste: Book review. Oper. Res. Lett. 35(1): 139-140 (2007)[24]
  • 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. Sched. 10(2): 139-146 (2007)[25]
  • 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[26]
  • Philippe Baptiste, Marek Chrobak, Christoph Dürr: Polynomial Time Algorithms for Minimum Energy Scheduling. ESA 2007: 136-150[27]
  • Giacomo Nannicini, Philippe Baptiste, Gilles Barbier, Daniel Krob, Leo Liberti: Fast paths in large-scale dynamic road networks. CoRR abs/0704.1068 (2007)[28]

2006

  • David Savourey, Philippe Baptiste, Antoine Jouglet: Lower bounds for parallel machines scheduling. RIVF 2006: 195-198[29]
  • 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[30]
  • Philippe Baptiste, Philippe Laborie, Claude Le Pape, Wim Nuijten: Constraint-Based Scheduling and Planning. Handbook of Constraint Programming 2006: 761-799[31]
  • 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)[32]

2005

  • Philippe Baptiste, Claude Le Pape: Scheduling a single machine to minimize a regular objective function under setup constraints. Discret. Optim. 2(1): 83-99 (2005)[33]
  • Huy Trandac, Philippe Baptiste, Vu Duong: Airspace sectorization with constraints. RAIRO Oper. Res. 39(2): 105-122 (2005)[34]
  • Konstantin Artiouchine, Philippe Baptiste:Inter-distance Constraint: An Extension of the All-Different Constraint for Scheduling Equal Length Jobs. CP 2005: 62-76[35]

2004

  • Philippe Baptiste, Peter Brucker, Sigrid Knust, Vadim G. Timkovsky: Ten notes on equal-processing-time scheduling. 4OR 2(2): 111-127 (2004)[36]
  • Philippe Baptiste, Jacques Carlier, Alix Munier, Andreas S. Schulz: Introduction. Ann. Oper. Res. 129(1-4): 17-19 (2004)[37]
  • Philippe Baptiste, Jacques Carlier, Antoine Jouglet: A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates. Eur. J. Oper. Res. 158(3): 595-608(2004)[38]
  • 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. Methods Oper. Res. 60(1): 145-153 (2004)[39]
  • 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)[40]
  • Philippe Baptiste, Sophie Demassey: Tight LP bounds for resource constrained project scheduling. OR Spectr. 26(2): 251-262 (2004)[41]
  • Dac-Huy Tran, Philippe Baptiste, Vu Duong: From Sets to Geometrical Sectors in the Airspace Sectorization Problem. RIVF 2004: 7-10[42]
  • Philippe Baptiste, Peter Brucker: Scheduling Equal Processing Time Jobs. Handbook of Scheduling 2004[3]
  • Antoine Jouglet, Philippe Baptiste, Jacques Carlier: Branch-and-Bound Algorithms for TotalWeighted Tardiness. Handbook of Scheduling 2004[3]
  • 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)[43]

2003

  • Philippe Baptiste: A note on scheduling multiprocessor tasks with identical processing times. Comput. Oper. Res. 30(13): 2071-2078 (2003)[44]
  • 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. Eur. J. Oper. Res. 144(1): 1-11(2003)[45]
  • Philippe Baptiste: On minimizing the weighted number of late jobs in unit execution time open-shops. Eur. J. Oper. Res. 149(2): 344-354 (2003)[46]
  • Philippe Baptiste, Baruch Schieber: A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness. J. Sched. 6(4): 395-404 (2003)[47]
  • Huy Trandac, Philippe Baptiste, Vu Duong: Airspace Sectorization By Constraint Programming. RIVF 2003: 49-58[48]

2002

  • Philippe Baptiste: Résultats de complexité et programmation par contraintes pour l'ordonnancement. University of Technology of Compiègne, France, 2002[49]
  • Antoine Jouglet, Philippe Baptiste, Jacques Carlier: Exact procedures for single machine total cost scheduling. SMC 2002: 4[50]
  • 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)[51]

2001

  • 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)[52]
  • Philippe Baptiste, Antoine Jouglet: On Minimizing Total Tardiness in a Serial Batching Problem. RAIRO Oper. Res. 35(1): 107-115 (2001)[53]
  • Philippe Baptiste, Vadim G. Timkovsky: On preemption redundancy in scheduling unit processing time jobs on two parallel machines. IPDPS 2001: 200[54]

2000

  • Philippe Baptiste, Claude Le Pape: Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems. Constraints An Int. J. 5(1/2): 119-139 (2000)[55]
  • Philippe Baptiste: Scheduling equal-length jobs on identical parallel machines. Discret. Appl. Math. 103(1-3): 21-32 (2000)[56]
  • Philippe Baptiste: Batching identical jobs. Math. Methods Oper. Res. 52(3): 355-367 (2000)[57]

1990 – 1999

1999

  • Philippe Baptiste, Claude Le Pape, Wim Nuijten: Satisfiability tests and time‐bound adjustmentsfor cumulative scheduling problems. Ann. Oper. Res. 92: 305-333 (1999)[58]
  • 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)[59]
  • Philippe Baptiste: An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Oper. Res. Lett. 24(4): 175-180 (1999)[60]

1998

  • Claude Le Pape, Philippe Baptiste: Resource Constraints for Preemptive Job-shop Scheduling. Constraints An Int. J. 3(4): 263-287 (1998)[61]
  • 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[62]

1997

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

1996

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

1995

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

Recognition

References

  1. ^ a b c d "CNES - Philippe Baptiste". CNES. 21 April 2021. Retrieved 14 January 2022.{{cite web}}: CS1 maint: url-status (link)
  2. ^ "Philippe Baptiste Appointed Senior Vice President, Scientific Development at Total". 2 August 2022. Retrieved 10 August 2022.{{cite web}}: CS1 maint: url-status (link)
  3. ^ a b c d "Philippe Baptiste". dblp.org. Retrieved 10 August 2022.{{cite web}}: CS1 maint: url-status (link)
  4. ^ 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. 216: 15–28. doi:10.1016/j.dam.2016.08.015. ISSN 0166-218X.
  5. ^ Baptiste, Ph.; Carlier, J.; Kononov, A.; Queyranne, M.; Sevastyanov, S.; Sviridenko, M. (2012-11-01). "Integer preemptive scheduling on parallel machines". Operations Research Letters. 40 (6): 440–444. doi:10.1016/j.orl.2012.06.011. ISSN 0167-6377.
  6. ^ Baptiste, Philippe; Chrobak, Marek; Dürr, Christoph (2012-07). "Polynomial-time algorithms for minimum energy scheduling". ACM Transactions on Algorithms. 8 (3): 1–29. doi:10.1145/2229163.2229170. ISSN 1549-6325. {{cite journal}}: Check date values in: |date= (help)
  7. ^ 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. 159 (5): 272–280. doi:10.1016/j.dam.2010.11.015. ISSN 0166-218X.
  8. ^ 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. 45 (1): 143–158. doi:10.1007/s10589-008-9172-y. ISSN 1573-2894.
  9. ^ Baptiste, Philippe (2010-03-06). "A note on scheduling identical coupled tasks in logarithmic time". Discrete Applied Mathematics. 158 (5): 583–587. doi:10.1016/j.dam.2009.10.012. ISSN 0166-218X.
  10. ^ 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. 203 (2): 476–483. doi:10.1016/j.ejor.2009.07.037. ISSN 0377-2217.
  11. ^ 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. 13 (1): 39–47. doi:10.1007/s10951-008-0092-6. ISSN 1099-1425. {{cite journal}}: no-break space character in |title= at position 61 (help)
  12. ^ Chrobak, Marek; Baptiste, Philippe; Dürr, Christoph (2010). Albers, Susanne; Baruah, Sanjoy K.; Möhring, Rolf H.; Pruhs, Kirk (eds.). "Polynomial Time Algorithms for Minimum Energy Scheduling". Scheduling. Dagstuhl Seminar Proceedings (DagSemProc). 10071. Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik: 1–12. doi:10.4230/DagSemProc.10071.8.
  13. ^ 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. 157 (17): 3656–3664. doi:10.1016/j.dam.2009.02.018. ISSN 0166-218X.
  14. ^ Baptiste, Philippe; Kendall, Graham; Munier, Alix; Sourd, Francis (2009-10-16). "Preface". Journal of Scheduling. 12 (6): 563. doi:10.1007/s10951-009-0136-6. ISSN 1099-1425.
  15. ^ Baptiste, Philippe (2009), Gent, Ian P. (ed.), "Constraint-Based Schedulers, Do They Really Work?", Principles and Practice of Constraint Programming - CP 2009, vol. 5732, Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 1–1, doi:10.1007/978-3-642-04244-7_1, ISBN 978-3-642-04243-0, retrieved 2022-08-10
  16. ^ Baptiste, Philippe; Carlier, Jacques; Kononov, Alexander; Queyranne, Maurice; Sevastyanov, Sergey; Sviridenko, Maxim (2009). Frid, Anna; Morozov, Andrey; Rybalchenko, Andrey; Wagner, Klaus W. (eds.). "Integrality Property in Preemptive Parallel Machine Scheduling". Computer Science - Theory and Applications. Berlin, Heidelberg: Springer: 38–46. doi:10.1007/978-3-642-03351-3_6. ISBN 978-3-642-03351-3.
  17. ^ Baptiste, Philippe; Chrobak, Marek; Durr, Christoph (2010-09-03). "Polynomial Time Algorithms for Minimum Energy Scheduling". arXiv:0908.3505 [cs].
  18. ^ 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. 35 (3): 906–915. doi:10.1016/j.cor.2006.05.009. ISSN 0305-0548.
  19. ^ 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. 184 (3): 879–899. doi:10.1016/j.ejor.2006.11.036. ISSN 0377-2217.
  20. ^ Artiouchine, Konstantin; Baptiste, Philippe; Dürr, Christoph (2008-09-16). "Runway sequencing with holding patterns". European Journal of Operational Research. 189 (3): 1254–1266. doi:10.1016/j.ejor.2006.06.076. ISSN 0377-2217.
  21. ^ 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. doi:10.1287/ijoc.1070.0234. ISSN 1091-9856.
  22. ^ Nannicini, Giacomo; Baptiste, Philippe; Krob, Daniel; Liberti, Leo (2008). Yang, Boting; Du, Ding-Zhu; Wang, Cao An (eds.). "Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks". Combinatorial Optimization and Applications. Berlin, Heidelberg: Springer: 225–234. doi:10.1007/978-3-540-85097-7_21. ISBN 978-3-540-85097-7.
  23. ^ Artiouchine, Konstantin; Baptiste, Philippe (2007-03-01). "Arc-B-consistency of the Inter-distance Constraint". Constraints. 12 (1): 3–19. doi:10.1007/s10601-006-9009-1. ISSN 1572-9354.
  24. ^ Baptiste, Philippe (2007-01-01). "Book review". Operations Research Letters. 35 (1): 139–140. doi:10.1016/j.orl.2006.01.001. ISSN 0167-6377.
  25. ^ 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. 10 (2): 139–146. doi:10.1007/s10951-006-0006-4. ISSN 1099-1425.
  26. ^ Nannicini, Giacomo; Baptiste, Philippe; Barbier, Gilles; Krob, Daniel; Liberti, Leo (2007-06-27). "Fast paths in large-scale dynamic road networks". arXiv:0704.1068 [cs].
  27. ^ Baptiste, Philippe; Chrobak, Marek; Dürr, Christoph (2007). Arge, Lars; Hoffmann, Michael; Welzl, Emo (eds.). "Polynomial Time Algorithms for Minimum Energy Scheduling". Algorithms – ESA 2007. Berlin, Heidelberg: Springer: 136–150. doi:10.1007/978-3-540-75520-3_14. ISBN 978-3-540-75520-3.
  28. ^ Nannicini, Giacomo; Baptiste, Philippe; Barbier, Gilles; Krob, Daniel; Liberti, Leo (2007-06-27). "Fast paths in large-scale dynamic road networks". arXiv:0704.1068 [cs].
  29. ^ Savourey, D.; Baptiste, P.; Jouglet, A. (2006-02). "Lower bounds for parallel machines scheduling". 2006 International Conference onResearch, Innovation and Vision for the Future: 195–198. doi:10.1109/RIVF.2006.1696437. {{cite journal}}: Check date values in: |date= (help)
  30. ^ Baptiste, Philippe (2006-01-22). "Scheduling unit tasks to minimize the number of idle periods: a polynomial time algorithm for offline dynamic power management". Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm. SODA '06. USA: Society for Industrial and Applied Mathematics: 364–367. doi:10.5555/1109557.1109598. ISBN 978-0-89871-605-4. {{cite journal}}: Check |doi= value (help)
  31. ^ Baptiste, Philippe; Laborie, Philippe; Pape, Claude Le; Nuijten, Wim (2006-01-01), Rossi, Francesca; van Beek, Peter; Walsh, Toby (eds.), "Chapter 22 - Constraint-Based Scheduling and Planning", Foundations of Artificial Intelligence, Handbook of Constraint Programming, vol. 2, Elsevier, pp. 761–799, retrieved 2022-08-10
  32. ^ 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". arXiv:cs/0605078.
  33. ^ Baptiste, Philippe; Le Pape, Claude (2005-03-30). "Scheduling a single machine to minimize a regular objective function under setup constraints". Discrete Optimization. 2 (1): 83–99. doi:10.1016/j.disopt.2004.12.003. ISSN 1572-5286.
  34. ^ Trandac, Huy; Baptiste, Philippe; Duong, Vu (2005-04-01). "Airspace sectorization with constraints". RAIRO - Operations Research. 39 (2): 105–122. doi:10.1051/ro:2005005. ISSN 0399-0559.
  35. ^ Artiouchine, Konstantin; Baptiste, Philippe (2005). van Beek, Peter (ed.). "Inter-distance Constraint: An Extension of the All-Different Constraint for Scheduling Equal Length Jobs". Principles and Practice of Constraint Programming - CP 2005. Berlin, Heidelberg: Springer: 62–76. doi:10.1007/11564751_8. ISBN 978-3-540-32050-0.
  36. ^ 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. 2 (2): 111–127. doi:10.1007/s10288-003-0024-4. ISSN 1619-4500.
  37. ^ Baptiste, Philippe; Carlier, Jacques; Munier, Alix; Schulz, Andreas (2004-07). "Introduction". Annals of Operations Research. 129 (1–4): 17–19. doi:10.1023/B:ANOR.0000030779.01529.d2. ISSN 0254-5330. {{cite journal}}: Check date values in: |date= (help)
  38. ^ 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. 158 (3): 595–608. doi:10.1016/S0377-2217(03)00378-3. ISSN 0377-2217.
  39. ^ 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. 60 (1): 145–153. doi:10.1007/s001860300336. ISSN 1432-5217.
  40. ^ 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. 32 (3): 258–264. doi:10.1016/j.orl.2003.09.004. ISSN 0167-6377.
  41. ^ Baptiste, Philippe; Demassey, Sophie (2004-03-01). "Tight LP bounds for resource constrained project scheduling". OR Spectrum. 26 (2): 251–262. doi:10.1007/s00291-003-0155-1. ISSN 1436-6304.
  42. ^ "Wayback Machine" (PDF). web.archive.org. Retrieved 2022-08-10.
  43. ^ 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". arXiv:cs/0412094.
  44. ^ Baptiste, Philippe (2003-11-01). "A note on scheduling multiprocessor tasks with identical processing times". Computers & Operations Research. 30 (13): 2071–2078. doi:10.1016/S0305-0548(02)00116-8. ISSN 0305-0548.
  45. ^ 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. 144 (1): 1–11. doi:10.1016/S0377-2217(01)00353-8. ISSN 0377-2217.
  46. ^ 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. 149 (2): 344–354. doi:10.1016/S0377-2217(02)00759-2. ISSN 0377-2217.
  47. ^ 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. 6 (4): 395–404. doi:10.1023/A:1024012811536. ISSN 1099-1425.
  48. ^ "Wayback Machine" (PDF). web.archive.org. Retrieved 2022-08-10.
  49. ^ Baptiste, Philippe (2002-07-01). Résultats de complexité et programmation par contraintes pour l'ordonnancement (thesis thesis). Université de Technologie de Compiègne.
  50. ^ Jouglet, A.; Baptiste, P.; Carlier, J. (2002-10). "Exact procedures for single machine total cost scheduling". IEEE International Conference on Systems, Man and Cybernetics. 6: 4 pp. vol.6–. doi:10.1109/ICSMC.2002.1175623. {{cite journal}}: Check date values in: |date= (help)
  51. ^ Baptiste, Philippe; Chrobak, Marek; Durr, Christoph; Jawor, Wojciech; Vakhania, Nodari (2003-03-11). "Preemptive Scheduling of Equal-Length Jobs to Maximize Weighted Throughput". arXiv:cs/0209033.
  52. ^ Baptiste, Philippe; Timkovsky, Vadim G. (2001-06-01). "On preemption redundancy in scheduling unit processing time jobs on two parallel machines". Operations Research Letters. 28 (5): 205–212. doi:10.1016/S0167-6377(01)00068-2. ISSN 0167-6377.
  53. ^ Baptiste, Philippe; Jouglet, Antoine (2001-01-01). "On Minimizing Total Tardiness in a Serial Batching Problem". RAIRO - Operations Research. 35 (1): 107–115. doi:10.1051/ro:2001105. ISSN 0399-0559.
  54. ^ Baptiste, P.; Timkovsky, V.G. (2001-04). "On preemption redundancy in scheduling unit processing time jobs on two parallel machines". Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001: 2152–2156. doi:10.1109/IPDPS.2001.925215. {{cite journal}}: Check date values in: |date= (help)
  55. ^ Baptiste, Philippe; Pape, Claude Le (2000-01-01). "Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems". Constraints. 5 (1): 119–139. doi:10.1023/A:1009822502231. ISSN 1572-9354.
  56. ^ Baptiste, Philippe (2000-07-15). "Scheduling equal-length jobs on identical parallel machines". Discrete Applied Mathematics. 103 (1): 21–32. doi:10.1016/S0166-218X(99)00238-3. ISSN 0166-218X.
  57. ^ Baptiste, Philippe (2000-12-01). "Batching identical jobs". Mathematical Methods of Operations Research. 52 (3): 355–367. doi:10.1007/s001860000088. ISSN 1432-5217.
  58. ^ Baptiste, Ph.; Le Pape, C.; Nuijten, W. (1999-01-01). "Satisfiability tests and time‐bound adjustmentsfor cumulative scheduling problems". Annals of Operations Research. 92 (0): 305–333. doi:10.1023/A:1018995000688. ISSN 1572-9338.
  59. ^ 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. 5 (3): 305–325. doi:10.1023/A:1009613717770. ISSN 1572-9397.
  60. ^ 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. 24 (4): 175–180. doi:10.1016/S0167-6377(98)00045-5. ISSN 0167-6377.
  61. ^ Pape, Claude Le; Baptiste, Philippe (1998-10-01). "Resource Constraints for Preemptive Job-shop Scheduling". Constraints. 3 (4): 263–287. doi:10.1023/A:1009723704757. ISSN 1572-9354.
  62. ^ Baptiste, Philippe; Le Pape, Claude; Peridy, Laurent (1998). Maher, Michael; Puget, Jean-Francois (eds.). "Global Constraints for Partial CSPs: A Case-Study of Resource and Due Date Constraints". Principles and Practice of Constraint Programming — CP98. Berlin, Heidelberg: Springer: 87–101. doi:10.1007/3-540-49481-2_8. ISBN 978-3-540-49481-2.
  63. ^ Baptiste, Philippe; Le Pape, Claude (1997). Smolka, Gert (ed.). "Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems". Principles and Practice of Constraint Programming-CP97. Berlin, Heidelberg: Springer: 375–389. doi:10.1007/BFb0017454. ISBN 978-3-540-69642-1.

See also


Flag of FranceBiography icon

This French engineer or inventor biographical article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Philippe_Baptiste&oldid=1103651112"