Philippe Baptiste

From MaRDI portal
Revision as of 06:02, 9 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Philippe Baptiste to Philippe Baptiste: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:207391

Available identifiers

zbMath Open baptiste.philippeWikidataQ106287381 ScholiaQ106287381MaRDI QIDQ207391

List of research outcomes

PublicationDate of PublicationType
Redundant cumulative constraints to compute preemptive bounds2017-12-20Paper
Graphs with maximal induced matchings of the same size2016-11-24Paper
Polynomial-time algorithms for minimum energy scheduling2014-09-09Paper
Integer preemptive scheduling on parallel machines2013-03-05Paper
The K King Problem, an Abstract Model for Computing Aircraft Landing Trajectories: On Modeling a Dynamic Hybrid System with Constraints2012-07-28Paper
https://portal.mardi4nfdi.de/entity/Q31157182012-02-10Paper
Properties of optimal schedules in preemptive shop scheduling2011-03-10Paper
Scheduling unit tasks to minimize the number of idle periods2010-08-16Paper
Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances2010-05-07Paper
A note on scheduling identical coupled tasks in logarithmic time2010-05-05Paper
On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups2010-04-28Paper
Fast paths in large-scale dynamic road networks2010-03-15Paper
On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation2010-03-09Paper
Time-indexed formulations for scheduling chains on a single machine: an application to airborne radars2009-12-21Paper
Integrality Property in Preemptive Parallel Machine Scheduling2009-08-18Paper
Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks2009-01-27Paper
Lower bounds for parallel machine scheduling problems2008-10-02Paper
Polynomial Time Algorithms for Minimum Energy Scheduling2008-09-25Paper
Inter-distance Constraint: An Extension of the All-Different Constraint for Scheduling Equal Length Jobs2008-09-09Paper
Runway sequencing with holding patterns2008-04-24Paper
Lagrangian bounds for just-in-time job-shop scheduling2007-10-19Paper
Dominance-based heuristics for one-machine total cost scheduling problems2007-10-10Paper
On scheduling a multifunction radar2007-06-08Paper
The complexity of mean flow time scheduling problems with release times2007-05-15Paper
Arc-B-consistency of the inter-distance constraint2007-05-10Paper
https://portal.mardi4nfdi.de/entity/Q34264332007-03-09Paper
Airspace sectorization with constraints2006-07-11Paper
https://portal.mardi4nfdi.de/entity/Q33741042006-03-09Paper
https://portal.mardi4nfdi.de/entity/Q54636082005-08-05Paper
Scheduling a single machine to minimize a regular objective function under setup constraints2005-06-01Paper
Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time2005-02-08Paper
Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time2004-10-28Paper
Tight LP bounds for resource constrained project scheduling2004-09-22Paper
A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates2004-08-10Paper
Preemptive scheduling of equal-length jobs to maximize weighted throughput.2004-03-15Paper
A note on scheduling multiprocessor tasks with identical processing times.2003-11-17Paper
A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness2003-08-21Paper
Batching identical jobs2003-08-18Paper
On minimizing the weighted number of late jobs in unit execution time open-shops.2003-07-30Paper
Constraint-based scheduling: Applying constraint programming to scheduling problems.2003-07-28Paper
A branch and bound to minimize the number of late jobs on a single machine with release time constraints2003-04-28Paper
On preemption redundancy in scheduling unit processing time jobs on two parallel machines2002-09-22Paper
On Minimizing Total Tardiness in a Serial Batching Problem2002-08-25Paper
Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times2001-11-06Paper
An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs2001-03-04Paper
Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems2000-08-13Paper
Scheduling equal-length jobs on identical parallel machines2000-07-11Paper
Satisfiability tests and time-bound adjustments for cumulative scheduling problems2000-01-11Paper
Resource constraints for preemptive job-shop scheduling1999-02-02Paper
Heuristic control of a constraint-based algorithm for the preemptive job-shop scheduling problem1999-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Philippe Baptiste