Author of the publication

Structured vs. Unstructured Large Neighborhood Search: A Case Study on Job-Shop Scheduling Problems with Earliness and Tardiness Costs.

, and . CP, volume 2833 of Lecture Notes in Computer Science, page 817-821. Springer, (2003)

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

Search Procedures and Parallelism in Constraint Programming.. CP, volume 1713 of Lecture Notes in Computer Science, page 346-360. Springer, (1999)Propagation Guided Large Neighborhood Search., , and . CP, volume 3258 of Lecture Notes in Computer Science, page 468-481. Springer, (2004)Foreword., and . Ann. Oper. Res., 184 (1): 1 (2011)A Contextual Bandit Approach for Learning to Plan in Environments with Probabilistic Goal Configurations., , , , , , , , and . ICRA, page 5645-5652. IEEE, (2023)ViolationLS: Constraint-Based Local Search in CP-SAT., , and . CPAIOR (1), volume 14742 of Lecture Notes in Computer Science, page 243-258. Springer, (2024)cc(M), a kernel implementing cc languages.. CCP, page 7:1-7:15. INRIA Rocquencourt, (1995)A Type System for Object-Oriented Database Programming and Querying Languages., and . DBPL, page 218-235. Morgan Kaufmann, (1991)Robust and Parallel Solving of a Network Design Problem., , , and . CP, volume 2470 of Lecture Notes in Computer Science, page 633-648. Springer, (2002)Structured vs. Unstructured Large Neighborhood Search: A Case Study on Job-Shop Scheduling Problems with Earliness and Tardiness Costs., and . CP, volume 2833 of Lecture Notes in Computer Science, page 817-821. Springer, (2003)Combining Forces to Solve the Car Sequencing Problem., and . CPAIOR, volume 3011 of Lecture Notes in Computer Science, page 225-239. Springer, (2004)