default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhilippe Baptiste
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j39]Philippe Baptiste, Nicolas Bonifas:
Redundant cumulative constraints to compute preemptive bounds. Discret. Appl. Math. 234: 168-177 (2018)- 2017
- [j38]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) - 2012
- [j37]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) - [j36]Philippe Baptiste, Marek Chrobak, Christoph Dürr:
Polynomial-time algorithms for minimum energy scheduling. ACM Trans. Algorithms 8(3): 26:1-26:29 (2012) - 2011
- [j35]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) - 2010
- [j34]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) - [j33]Philippe Baptiste:
A note on scheduling identical coupled tasks in logarithmic time. Discret. Appl. Math. 158(5): 583-587 (2010) - [j32]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) - [j31]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) - [i6]Marek Chrobak, Philippe Baptiste, Christoph Dürr:
Polynomial Time Algorithms for Minimum Energy Scheduling. Scheduling 2010
2000 – 2009
- 2009
- [j30]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) - [j29]Philippe Baptiste, Graham Kendall, Alix Munier, Francis Sourd:
Preface. J. Sched. 12(6): 563-564 (2009) - [c17]Philippe Baptiste:
Constraint-Based Schedulers, Do They Really Work? CP 2009: 1 - [c16]Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko:
Integrality Property in Preemptive Parallel Machine Scheduling. CSR 2009: 38-46 - [i5]Philippe Baptiste, Marek Chrobak, Christoph Dürr:
Polynomial Time Algorithms for Minimum Energy Scheduling. CoRR abs/0908.3505 (2009) - 2008
- [j28]Philippe Baptiste, Marta Flamini, Francis Sourd:
Lagrangian bounds for just-in-time job-shop scheduling. Comput. Oper. Res. 35(3): 906-915 (2008) - [j27]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) - [j26]Konstantin Artiouchine, Philippe Baptiste, Christoph Dürr:
Runway sequencing with holding patterns. Eur. J. Oper. Res. 189(3): 1254-1266 (2008) - [j25]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) - [c15]Giacomo Nannicini, Philippe Baptiste, Daniel Krob, Leo Liberti:
Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks. COCOA 2008: 225-234 - 2007
- [j24]Konstantin Artiouchine, Philippe Baptiste:
Arc-B-consistency of the Inter-distance Constraint. Constraints An Int. J. 12(1): 3-19 (2007) - [j23]Philippe Baptiste:
Book review. Oper. Res. Lett. 35(1): 139-140 (2007) - [j22]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) - [c14]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 - [c13]Philippe Baptiste, Marek Chrobak, Christoph Dürr:
Polynomial Time Algorithms for Minimum Energy Scheduling. ESA 2007: 136-150 - [i4]Giacomo Nannicini, Philippe Baptiste, Gilles Barbier, Daniel Krob, Leo Liberti:
Fast paths in large-scale dynamic road networks. CoRR abs/0704.1068 (2007) - 2006
- [c12]David Savourey, Philippe Baptiste, Antoine Jouglet:
Lower bounds for parallel machines scheduling. RIVF 2006: 195-198 - [c11]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 - [r3]Philippe Baptiste, Philippe Laborie, Claude Le Pape, Wim Nuijten:
Constraint-Based Scheduling and Planning. Handbook of Constraint Programming 2006: 761-799 - [i3]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) - 2005
- [j21]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) - [j20]Huy Trandac, Philippe Baptiste, Vu Duong:
Airspace sectorization with constraints. RAIRO Oper. Res. 39(2): 105-122 (2005) - [c10]Konstantin Artiouchine, Philippe Baptiste:
Inter-distance Constraint: An Extension of the All-Different Constraint for Scheduling Equal Length Jobs. CP 2005: 62-76 - 2004
- [j19]Philippe Baptiste, Peter Brucker, Sigrid Knust, Vadim G. Timkovsky:
Ten notes on equal-processing-time scheduling. 4OR 2(2): 111-127 (2004) - [j18]Philippe Baptiste, Jacques Carlier, Alix Munier, Andreas S. Schulz:
Introduction. Ann. Oper. Res. 129(1-4): 17-19 (2004) - [j17]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) - [j16]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) - [j15]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) - [j14]Philippe Baptiste, Sophie Demassey:
Tight LP bounds for resource constrained project scheduling. OR Spectr. 26(2): 251-262 (2004) - [c9]Dac-Huy Tran, Philippe Baptiste, Vu Duong:
From Sets to Geometrical Sectors in the Airspace Sectorization Problem. RIVF 2004: 7-10 - [r2]Philippe Baptiste, Peter Brucker:
Scheduling Equal Processing Time Jobs. Handbook of Scheduling 2004 - [r1]Antoine Jouglet, Philippe Baptiste, Jacques Carlier:
Branch-and-Bound Algorithms for TotalWeighted Tardiness. Handbook of Scheduling 2004 - [i2]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) - 2003
- [j13]Philippe Baptiste:
A note on scheduling multiprocessor tasks with identical processing times. Comput. Oper. Res. 30(13): 2071-2078 (2003) - [j12]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) - [j11]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) - [j10]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) - [c8]Huy Trandac, Philippe Baptiste, Vu Duong:
Airspace Sectorization By Constraint Programming. RIVF 2003: 49-58 - 2002
- [b1]Philippe Baptiste:
Résultats de complexité et programmation par contraintes pour l'ordonnancement. University of Technology of Compiègne, France, 2002 - [c7]Antoine Jouglet, Philippe Baptiste, Jacques Carlier:
Exact procedures for single machine total cost scheduling. SMC 2002: 4 - [i1]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) - 2001
- [j9]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) - [j8]Philippe Baptiste, Antoine Jouglet:
On Minimizing Total Tardiness in a Serial Batching Problem. RAIRO Oper. Res. 35(1): 107-115 (2001) - [c6]Philippe Baptiste, Vadim G. Timkovsky:
On preemption redundancy in scheduling unit processing time jobs on two parallel machines. IPDPS 2001: 200 - 2000
- [j7]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) - [j6]Philippe Baptiste:
Scheduling equal-length jobs on identical parallel machines. Discret. Appl. Math. 103(1-3): 21-32 (2000) - [j5]Philippe Baptiste:
Batching identical jobs. Math. Methods Oper. Res. 52(3): 355-367 (2000)
1990 – 1999
- 1999
- [j4]Philippe Baptiste, Claude Le Pape, Wim Nuijten:
Satisfiability tests and time‐bound adjustmentsfor cumulative scheduling problems. Ann. Oper. Res. 92: 305-333 (1999) - [j3]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) - [j2]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) - 1998
- [j1]Claude Le Pape, Philippe Baptiste:
Resource Constraints for Preemptive Job-shop Scheduling. Constraints An Int. J. 3(4): 263-287 (1998) - [c5]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 - 1997
- [c4]Philippe Baptiste, Claude Le Pape:
Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems. CP 1997: 375-389 - [c3]Claude Le Pape, Philippe Baptiste:
A Constraint Programming Library for Preemptive and Non-Preemptive Scheduling. PACT 1997: 237-256 - 1996
- [c2]Claude Le Pape, Philippe Baptiste:
Constraint Propagation Techniques for Disjunctive Scheduling: The Preemptive Case. ECAI 1996: 619-623 - 1995
- [c1]Philippe Baptiste, Claude Le Pape:
A Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling. IJCAI (1) 1995: 600-606
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
