Philippe Baptiste

According to our database1, Philippe Baptiste authored at least 57 papers between 1995 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Redundant cumulative constraints to compute preemptive bounds.
Discret. Appl. Math., 2018

2017
Graphs with maximal induced matchings of the same size.
Discret. Appl. Math., 2017

2012
Polynomial-time algorithms for minimum energy scheduling.
ACM Trans. Algorithms, 2012

Integer preemptive scheduling on parallel machines.
Oper. Res. Lett., 2012

2011
Properties of optimal schedules in preemptive shop scheduling.
Discret. Appl. Math., 2011

2010
Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances.
J. Sched., 2010

Time-indexed formulations for scheduling chains on a single machine: An application to airborne radars.
Eur. J. Oper. Res., 2010

A note on scheduling identical coupled tasks in logarithmic time.
Discret. Appl. Math., 2010

Fast paths in large-scale dynamic road networks.
Comput. Optim. Appl., 2010

2009
Preface.
J. Sched., 2009

On maximizing the profit of a satellite launcher: Selecting and scheduling tasks with time windows and setups.
Discret. Appl. Math., 2009

Integrality Property in Preemptive Parallel Machine Scheduling.
Proceedings of the Computer Science, 2009

Constraint-Based Schedulers, Do They Really Work?
Proceedings of the Principles and Practice of Constraint Programming, 2009

2008
The K King Problem, an Abstract Model for Computing Aircraft Landing Trajectories: On Modeling a Dynamic Hybrid System with Constraints.
INFORMS J. Comput., 2008

Dominance-based heuristics for one-machine total cost scheduling problems.
Eur. J. Oper. Res., 2008

Runway sequencing with holding patterns.
Eur. J. Oper. Res., 2008

Lagrangian bounds for just-in-time job-shop scheduling.
Comput. Oper. Res., 2008

Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks.
Proceedings of the Combinatorial Optimization and Applications, 2008

2007
The complexity of mean flow time scheduling problems with release times.
J. Sched., 2007

Book review.
Oper. Res. Lett., 2007

Arc-B-consistency of the Inter-distance Constraint.
Constraints An Int. J., 2007

Fast point-to-point shortest path queries on dynamic road networks with interfal data.
Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

2006
Constraint-Based Scheduling and Planning.
Proceedings of the Handbook of Constraint Programming, 2006

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 Algorithms, 2006

Lower bounds for parallel machines scheduling.
Proceedings of the 4th International Confernce on Computer Sciences: Research, 2006

2005
Airspace sectorization with constraints.
RAIRO Oper. Res., 2005

Scheduling a single machine to minimize a regular objective function under setup constraints.
Discret. Optim., 2005

Inter-distance Constraint: An Extension of the All-Different Constraint for Scheduling Equal Length Jobs.
Proceedings of the Principles and Practice of Constraint Programming, 2005

2004
Branch-and-Bound Algorithms for TotalWeighted Tardiness.
Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

Scheduling Equal Processing Time Jobs.
Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

Tight LP bounds for resource constrained project scheduling.
OR Spectr., 2004

Preemptive scheduling of equal-length jobs to maximize weighted throughput.
Oper. Res. Lett., 2004

Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time.
Math. Methods Oper. Res., 2004

A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates.
Eur. J. Oper. Res., 2004

Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time
CoRR, 2004

Introduction.
Ann. Oper. Res., 2004

Ten notes on equal-processing-time scheduling.
4OR, 2004

From Sets to Geometrical Sectors in the Airspace Sectorization Problem.
Proceedings of the Actes de la Deuxieme Conference Internationale Associant Chercheurs Vietnamiens et Francophones en Informatique, 2004

2003
A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness.
J. Sched., 2003

A branch and bound to minimize the number of late jobs on a single machine with release time constraints.
Eur. J. Oper. Res., 2003

On minimizing the weighted number of late jobs in unit execution time open-shops.
Eur. J. Oper. Res., 2003

A note on scheduling multiprocessor tasks with identical processing times.
Comput. Oper. Res., 2003

Airspace Sectorization By Constraint Programming.
Proceedings of the Actes de la Première Conférence Internationale RIVF'03 Rencontres en Informatique Vietnam-France, 2003

2002
Exact procedures for single machine total cost scheduling.
Proceedings of the IEEE International Conference on Systems, Man and Cybernetics: Bridging the Digital Divide, Yasmine Hammamet, Tunisia, October 6-9, 2002, 2002

Résultats de complexité et programmation par contraintes pour l'ordonnancement.
, 2002

2001
On Minimizing Total Tardiness in a Serial Batching Problem.
RAIRO Oper. Res., 2001

On preemption redundancy in scheduling unit processing time jobs on two parallel machines.
Oper. Res. Lett., 2001

2000
Batching identical jobs.
Math. Methods Oper. Res., 2000

Scheduling equal-length jobs on identical parallel machines.
Discret. Appl. Math., 2000

Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems.
Constraints An Int. J., 2000

1999
An O(<i>n</i><sup>4</sup>) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs.
Oper. Res. Lett., 1999

Heuristic Control of a Constraint-Based Algorithm for the Preemptive Job-Shop Scheduling Problem.
J. Heuristics, 1999

Satisfiability tests and time‐bound adjustmentsfor cumulative scheduling problems.
Ann. Oper. Res., 1999

1998
Resource Constraints for Preemptive Job-shop Scheduling.
Constraints An Int. J., 1998

Global Constraints for Partial CSPs: A Case-Study of Resource and Due Date Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 1998

1996
Constraint Propagation Techniques for Disjunctive Scheduling: The Preemptive Case.
Proceedings of the 12th European Conference on Artificial Intelligence, 1996

1995
A Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995


  Loading...