Baptiste Philippe

Philippe Baptiste

Information about the author Philippe Baptiste will soon be added to the site.
Found 20 papers in total
Fast paths in large-scale dynamic road networks
Fast paths in large-scale dynamic road networks
2010
Efficiently computing fast paths in large-scale dynamic road networks (where dynamic...
On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
2009
We study the scheduling situation in which a set of jobs subjected to release dates...
The K King Problem, an Abstract Model for Computing Aircraft Landing Trajectories: On Modeling a Dynamic Hybrid System with Constraints
The K King Problem, an Abstract Model for Computing Aircraft Landing Trajectories: On Modeling a Dynamic Hybrid System with Constraints
2008
Motivated by the problem of computing trajectories of a set of aircraft in their final...
Lower bounds for parallel machine scheduling problems
Lower bounds for parallel machine scheduling problems
2008
We study the parallel machine scheduling problem with release dates and consider...
Lagrangian bounds for just-in-time job-shop scheduling
Lagrangian bounds for just-in-time job-shop scheduling
2008
We study the job-shop scheduling problem with earliness and tardiness penalties. We...
The complexity of mean flow time scheduling problems with release times
The complexity of mean flow time scheduling problems with release times
2007
We study the problem of preemptive scheduling of n jobs with given release times on m...
A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness
A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness
2003
We study the scheduling situation where n tasks, subjected to release dates and due...
Airspace sectorization with constraints
Airspace sectorization with constraints
2005
We consider the Airspace Sectorization Problem (ASP) in which airspace has to be...
Scheduling a single machine to minimise a regular objective function under setup constraints
Scheduling a single machine to minimise a regular objective function under setup constraints
2005
Motivated by industrial applications, we study the scheduling situation in which a set...
A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates
A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates
2004
In this paper, we present a Branch-and-Bound procedure to minimize total tardiness on...
On minimizing the weighted number of late jobs in unit execution time open-shops
On minimizing the weighted number of late jobs in unit execution time open-shops
2003
We study unit execution time open-shops with integer release dates. This paper shows...
Disjunctive constraints for manufacturing scheduling: principles and extensions
Disjunctive constraints for manufacturing scheduling: principles and extensions
1996
Disjunctive constraints are widely used to ensure that the time intervals over which...
Preemptive scheduling of equal-length jobs to maximize weighted throughput
Preemptive scheduling of equal-length jobs to maximize weighted throughput
2004
We study the problem of computing a preemptive schedule of equal-length jobs with...
A note on scheduling multiprocessor tasks with identical processing times
A note on scheduling multiprocessor tasks with identical processing times
2003
We study the scheduling situation where n tasks with identical processing times have...
A branch and bound to minimize the number of late jobs on a single machine with release time constraints
A branch and bound to minimize the number of late jobs on a single machine with release time constraints
2003
This paper presents a branch and bound algorithm for the single machine scheduling...
Solving hybrid flow shop problem using energetic reasoning and global operations
Solving hybrid flow shop problem using energetic reasoning and global operations
2001
This paper shows that the use of satisfiability tests and time-bound adjustments based...
On preemption redundancy in scheduling unit processing time jobs on two parallel machines
On preemption redundancy in scheduling unit processing time jobs on two parallel machines
2001
McNaughton's theorem states that preemptions in scheduling arbitrary processing time...
An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
1999
We study the problem of minimizing, the preemptive case, the number of late jobs on a...
Satisfiability tests and time-bound adjustments for cumulative scheduling problems
Satisfiability tests and time-bound adjustments for cumulative scheduling problems
1999
This paper presents a set of satisfiability tests and time-bound adjustment algorithms...
Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
1999
We study the problem of minimizing the weighted number of late jobs to be scheduled on...
Papers per page: