The following pages link to Philippe Baptiste (Q207391):
Displaying 50 items.
- Graphs with maximal induced matchings of the same size (Q344824) (← links)
- A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates (Q596267) (← links)
- (Q628303) (redirect page) (← links)
- Properties of optimal schedules in preemptive shop scheduling (Q628308) (← links)
- Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time (Q706379) (← links)
- Arc-B-consistency of the inter-distance constraint (Q879973) (← links)
- The complexity of mean flow time scheduling problems with release times (Q880590) (← links)
- Lower bounds for parallel machine scheduling problems (Q947338) (← links)
- On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups (Q967435) (← links)
- A note on scheduling identical coupled tasks in logarithmic time (Q968178) (← links)
- Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances (Q969755) (← links)
- Time-indexed formulations for scheduling chains on a single machine: an application to airborne radars (Q1046123) (← links)
- Resource constraints for preemptive job-shop scheduling (Q1277297) (← links)
- An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs (Q1306357) (← links)
- Constraint-based scheduling: Applying constraint programming to scheduling problems. (Q1398125) (← links)
- On minimizing the weighted number of late jobs in unit execution time open-shops. (Q1399578) (← links)
- Batching identical jobs (Q1401637) (← links)
- A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness (Q1404273) (← links)
- A note on scheduling multiprocessor tasks with identical processing times. (Q1413834) (← links)
- Preemptive scheduling of equal-length jobs to maximize weighted throughput. (Q1426730) (← links)
- Scheduling equal-length jobs on identical parallel machines (Q1570817) (← links)
- Redundant cumulative constraints to compute preemptive bounds (Q1686060) (← links)
- Scheduling a single machine to minimize a regular objective function under setup constraints (Q1779690) (← links)
- Heuristic control of a constraint-based algorithm for the preemptive job-shop scheduling problem (Q1854902) (← links)
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints (Q1869685) (← links)
- Tight LP bounds for resource constrained project scheduling (Q1880319) (← links)
- Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time (Q1885337) (← links)
- Integer preemptive scheduling on parallel machines (Q1939681) (← links)
- Satisfiability tests and time-bound adjustments for cumulative scheduling problems (Q1960325) (← links)
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times (Q1964481) (← links)
- Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems (Q1975206) (← links)
- Fast paths in large-scale dynamic road networks (Q2268926) (← links)
- Dominance-based heuristics for one-machine total cost scheduling problems (Q2384840) (← links)
- Lagrangian bounds for just-in-time job-shop scheduling (Q2456651) (← links)
- Runway sequencing with holding patterns (Q2482798) (← links)
- On minimizing total tardiness in a serial batching problem (Q2765603) (← links)
- The \(K\) king problem, an abstract model for computing aircraft landing trajectories: on modeling a dynamic hybrid system with constraints (Q2901007) (← links)
- (Q3115718) (← links)
- Polynomial-time algorithms for minimum energy scheduling (Q3189067) (← links)
- (Q3374104) (← links)
- Integrality Property in Preemptive Parallel Machine Scheduling (Q3392940) (← links)
- (Q3426433) (← links)
- On scheduling a multifunction radar (Q3445940) (← links)
- Inter-distance Constraint: An Extension of the All-Different Constraint for Scheduling Equal Length Jobs (Q3524164) (← links)
- Polynomial Time Algorithms for Minimum Energy Scheduling (Q3527206) (← links)
- Scheduling unit tasks to minimize the number of idle periods (Q3581578) (← links)
- On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation (Q5187929) (← links)
- (Q5463608) (← links)
- Airspace sectorization with constraints (Q5479855) (← links)
- Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks (Q5505661) (← links)
