( en | de | ru )

 

Disambiguation of "Baptiste, Philippe"

Author of the publication

copydeleteadd this publication to your clipboard
Branch-and-Bound Algorithms for TotalWeighted Tardiness.

, , and . Handbook of Scheduling, Chapman and Hall/CRC, (2004)

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

Ferdinand Baptiste

Baptiste Schmid

Ferdinand Baptiste

Baptiste Blanpain

 

Other publications of authors with the same name

Branch-and-Bound Algorithms for TotalWeighted Tardiness., , and . Handbook of Scheduling, Chapman and Hall/CRC, (2004)Polynomial-time algorithms for minimum energy scheduling., , and . ACM Trans. Algorithms, 8 (3): 26:1-26:29 (2012)Polynomial Time Algorithms for Minimum Energy Scheduling., , and . ESA, volume 4698 of Lecture Notes in Computer Science, page 136-150. Springer, (2007)Constraint-Based Schedulers, Do They Really Work?. CP, volume 5732 of Lecture Notes in Computer Science, page 1. Springer, (2009)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 Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems., and . Constraints An Int. J., 5 (1/2): 119-139 (2000)The K King Problem, an Abstract Model for Computing Aircraft Landing Trajectories: On Modeling a Dynamic Hybrid System with Constraints., , and . INFORMS J. Comput., 20 (2): 222-233 (2008)On Minimizing Total Tardiness in a Serial Batching Problem., and . RAIRO Oper. Res., 35 (1): 107-115 (2001)Polynomial Time Algorithms for Minimum Energy Scheduling., , and . Scheduling, volume 10071 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2010)On preemption redundancy in scheduling unit processing time jobs on two parallel machines., and . IPDPS, page 200. IEEE Computer Society, (2001)