Author of the publication

Constraint Propagation Techniques for Disjunctive Scheduling: The Preemptive Case.

, and . ECAI, page 619-623. John Wiley and Sons, Chichester, (1996)

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.

 

Other publications of authors with the same name

Scheduling a single machine to minimize a regular objective function under setup constraints., and . Discret. Optim., 2 (1): 83-99 (2005)On Minimizing Total Tardiness in a Serial Batching Problem., and . RAIRO Oper. Res., 35 (1): 107-115 (2001)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)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)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)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)Branch-and-Bound Algorithms for TotalWeighted Tardiness., , and . Handbook of Scheduling, Chapman and Hall/CRC, (2004)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-Based Scheduling and Planning., , , and . Handbook of Constraint Programming, volume 2 of Foundations of Artificial Intelligence, Elsevier, (2006)