Searching for authors named "Philippe Baptiste" – sorted by Relevance.
-
Preemptive Scheduling of Identical Machines
- We study the scheduling situation where jobs, subject to due-dates or deadlines, have to be preemptively scheduled on parallel identical machines. We rst provide a closed form expression for the optimum value of Lmax , the maximal lateness. We show that it can be computed in O(n log n), hence improv
- Cited by 2 (1 self) – Add To MetaCart
-
Batching Identical Jobs
- We study the problems of scheduling jobs, with dierent release dates and equal processing times, on two types of batching machines. All jobs of the same batch start and are completed simultaneously. On a serial batching machine, the length of a batch equals the sum of the processing times of its
- Cited by 3 (0 self) – Add To MetaCart
-
On Minimizing Total Tardiness In A Serial Batching Problem
- . We study the problem of scheduling jobs on a serial batching machine to minimize total tardiness. Jobs of the same batch start and are completed simultaneously and the length of a batch equals the sum of the processing times of its jobs. When a new batch starts, a constant setup time s occurs. Thi
- Cited by 2 (1 self) – Add To MetaCart
-
A Note on Scheduling Multiprocessor Tasks with Identical Processing times
- We study the scheduling situation where n tasks with identical processing times have to be scheduled on m parallel processors. Each task is subjected to a release date and requires simultaneously a xed number of processors. We show that, for each xed value of m, the problems of minimizing makespan a
- Add To MetaCart
-
On Preemption Redundancy in Scheduling Unit Processing Time Jobs on Two Parallel Machines
- McNaughton's theorem (1959) states that preemptions in scheduling arbitrary processing time jobs on identical parallel machines to minimize the total weighted completion time are redundant. Du, Leung and Young (1991) proved that this remains true even though the jobs have precedence constraints in t
- Cited by 2 (0 self) – Add To MetaCart
-
Constraint-Based Scheduling: Two Extensions
- ILOG, the company in which this thesis has been done, develops and markets ILOG SCHEDULE, a C++ library aimed at simplifying the representation and the resolution of scheduling problems. The SCHEDULE library is itself based on ILOG SOLVER, a generic software tool for object-oriented constraint progr
- Cited by 4 (3 self) – Add To MetaCart
-
Runway Sequencing with Holding Patterns
- We study a scheduling problem, motivated by air-traffic control, in which a set of aircrafts are about to land on a single runway. When coming close to the landing area of the airport, a set of time windows in which the landing is possible, is automatically assigned to each aircraft. The objectiv
- Cited by 1 (0 self) – Add To MetaCart
-
Disjunctive Constraints For Manufacturing Scheduling: Principles And Extensions
- Disjunctive constraints are widely used to ensure that the time intervals over whichtwo activities require the same resource do not overlap in time. Twotypes of extensions of disjunctive constraints are proposed: #1# extensions allowing the representation of more complex constraints including act
- Cited by 15 (3 self) – Add To MetaCart
-
Resource Constraints for Preemptive and Non-Preemptive Scheduling
- Ilog, the company in which this thesis has been done, develops and markets Ilog Schedule, a C++ library aimed at simplifying the representation and the resolution of scheduling problems. The Schedule library is itself based on Ilog Solver, a generic software tool for object-oriented constraint progr
- Cited by 7 (3 self) – Add To MetaCart
-
Solving Hybrid Flow Shop Problem Using Energetic Reasoning and Global Operations
- This paper shows that the use of satisability tests and time bound adjustments based on energetic reasoning and global operations can enhance the eciency of branch and bound procedures for optimally solving the hybrid ow shop scheduling problem. Procedures to use energetic reasoning and extended
- Cited by 2 (0 self) – Add To MetaCart

