| 2008 |
|---|
| 39 | EE | Giacomo Nannicini,
Philippe Baptiste,
Daniel Krob,
Leo Liberti:
Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks.
COCOA 2008: 225-234 |
| 38 | EE | Philippe Baptiste,
Marta Flamini,
Francis Sourd:
Lagrangian bounds for just-in-time job-shop scheduling.
Computers & OR 35(3): 906-915 (2008) |
| 37 | EE | Antoine Jouglet,
David Savourey,
Jacques Carlier,
Philippe Baptiste:
Dominance-based heuristics for one-machine total cost scheduling problems.
European Journal of Operational Research 184(3): 879-899 (2008) |
| 36 | EE | Konstantin Artiouchine,
Philippe Baptiste,
Christoph Dürr:
Runway sequencing with holding patterns.
European Journal of Operational Research 189(3): 1254-1266 (2008) |
| 35 | EE | 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 Journal on Computing 20(2): 222-233 (2008) |
| 2007 |
|---|
| 34 | | 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 |
| 33 | EE | Philippe Baptiste,
Marek Chrobak,
Christoph Dürr:
Polynomial Time Algorithms for Minimum Energy Scheduling.
ESA 2007: 136-150 |
| 32 | EE | Giacomo Nannicini,
Philippe Baptiste,
Gilles Barbier,
Daniel Krob,
Leo Liberti:
Fast paths in large-scale dynamic road networks
CoRR abs/0704.1068: (2007) |
| 31 | EE | Konstantin Artiouchine,
Philippe Baptiste:
Arc-B-consistency of the Inter-distance Constraint.
Constraints 12(1): 3-19 (2007) |
| 30 | EE | 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. Scheduling 10(2): 139-146 (2007) |
| 29 | EE | Philippe Baptiste:
Book review.
Oper. Res. Lett. 35(1): 139-140 (2007) |
| 2006 |
|---|
| 28 | EE | David Savourey,
Philippe Baptiste,
Antoine Jouglet:
Lower bounds for parallel machines scheduling.
RIVF 2006: 195-198 |
| 27 | EE | 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 |
| 26 | EE | 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 |
|---|
| 25 | EE | Konstantin Artiouchine,
Philippe Baptiste:
Inter-distance Constraint: An Extension of the All-Different Constraint for Scheduling Equal Length Jobs.
CP 2005: 62-76 |
| 24 | EE | Philippe Baptiste,
Claude Le Pape:
Scheduling a single machine to minimize a regular objective function under setup constraints.
Discrete Optimization 2(1): 83-99 (2005) |
| 2004 |
|---|
| 23 | EE | Dac-Huy Tran,
Philippe Baptiste,
Vu Duong:
From Sets to Geometrical Sectors in the Airspace Sectorization Problem.
RIVF 2004: 7-10 |
| 22 | EE | Philippe Baptiste,
Peter Brucker,
Sigrid Knust,
Vadim G. Timkovsky:
Ten notes on equal-processing-time scheduling.
4OR 2(2): 111-127 (2004) |
| 21 | EE | Philippe Baptiste,
Jacques Carlier,
Alix Munier,
Andreas Schulz:
Introduction.
Annals OR 129(1-4): 17-19 (2004) |
| 20 | EE | 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) |
| 19 | EE | Philippe Baptiste,
Jacques Carlier,
Antoine Jouglet:
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 (2004) |
| 18 | EE | 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) |
| 2003 |
|---|
| 17 | EE | Huy Trandac,
Philippe Baptiste,
Vu Duong:
Airspace Sectorization By Constraint Programming.
RIVF 2003: 49-58 |
| 16 | EE | Philippe Baptiste:
A note on scheduling multiprocessor tasks with identical processing times.
Computers & OR 30(13): 2071-2078 (2003) |
| 15 | EE | 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.
European Journal of Operational Research 144(1): 1-11 (2003) |
| 14 | EE | Philippe Baptiste:
On minimizing the weighted number of late jobs in unit execution time open-shops.
European Journal of Operational Research 149(2): 344-354 (2003) |
| 13 | | Philippe Baptiste,
Baruch Schieber:
A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness.
J. Scheduling 6(4): 395-404 (2003) |
| 2002 |
|---|
| 12 | EE | 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 |
|---|
| 11 | | Philippe Baptiste,
Vadim G. Timkovsky:
On preemption redundancy in scheduling unit processing time jobs on two parallel machines.
IPDPS 2001: 200 |
| 10 | EE | 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) |
| 2000 |
|---|
| 9 | | Philippe Baptiste,
Claude Le Pape:
Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems.
Constraints 5(1/2): 119-139 (2000) |
| 8 | | Philippe Baptiste:
Scheduling equal-length jobs on identical parallel machines.
Discrete Applied Mathematics 103(1-3): 21-32 (2000) |
| 1999 |
|---|
| 7 | | 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) |
| 6 | EE | 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 |
|---|
| 5 | EE | 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 |
| 4 | | Claude Le Pape,
Philippe Baptiste:
Resource Constraints for Preemptive Job-shop Scheduling.
Constraints 3(4): 263-287 (1998) |
| 1997 |
|---|
| 3 | | Philippe Baptiste,
Claude Le Pape:
Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems.
CP 1997: 375-389 |
| 1996 |
|---|
| 2 | | Claude Le Pape,
Philippe Baptiste:
Constraint Propagation Techniques for Disjunctive Scheduling: The Preemptive Case.
ECAI 1996: 619-623 |
| 1995 |
|---|
| 1 | | Philippe Baptiste,
Claude Le Pape:
A Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling.
IJCAI (1) 1995: 600-606 |
