( en | de | ru )

 

Disambiguation of "Baptiste, Philippe"

Author of the publication

copydeleteadd this publication to your clipboard
Polynomial Time Algorithms for Minimum Energy Scheduling.

, , and . Scheduling, volume 10071 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Harald Baptiste

Baptiste Schmid

Ferdinand Baptiste

Ferdinand Baptiste

Baptiste Blanpain

 

Other publications of authors with the same name

Polynomial-time algorithms for minimum energy scheduling., , and . ACM Trans. Algorithms, 8 (3): 26:1-26:29 (2012)Tight LP bounds for resource constrained project scheduling., and . OR Spectrum, 26 (2): 251-262 (2004)Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks., , , and . COCOA, volume 5165 of Lecture Notes in Computer Science, page 225-234. Springer, (2008)Constraint-Based Schedulers, Do They Really Work?. CP, volume 5732 of Lecture Notes in Computer Science, page 1. Springer, (2009)Polynomial Time Algorithms for Minimum Energy Scheduling., , and . ESA, volume 4698 of Lecture Notes in Computer Science, page 136-150. Springer, (2007)Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time., and . Math. Methods Oper. Res., 60 (1): 145-153 (2004)Branch-and-Bound Algorithms for TotalWeighted Tardiness., , and . Handbook of Scheduling, Chapman and Hall/CRC, (2004)Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems., and . Constraints An Int. J., 5 (1/2): 119-139 (2000)On Minimizing Total Tardiness in a Serial Batching Problem., and . RAIRO Oper. Res., 35 (1): 107-115 (2001)An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs.. Oper. Res. Lett., 24 (4): 175-180 (1999)