Laurent Péridy

According to our database1, Laurent Péridy authored at least 10 papers between 1993 and 2009.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2009
Cut generation for an employee timetabling problem.
European Journal of Operational Research, 2009

2005
Local adjustments: A general algorithm.
European Journal of Operational Research, 2005

2004
Elimination Rules for Job-Shop Scheduling Problem.
Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

A Branch and Bound Algorithm to Minimize Total Weighted Tardiness on a Single Processor.
Annals OR, 2004

2003
Using short-term memory to minimize the weighted number of late jobs on a single machine.
European Journal of Operational Research, 2003

A branch and bound to minimize the number of late jobs on a single machine with release time constraints.
European Journal of Operational Research, 2003

1998
Global Constraints for Partial CSPs: A Case-Study of Resource and Due Date Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 1998

1996
Constraint Logic Programming for Examination Timetabling.
J. Log. Program., 1996

1995
A CLP Approach for Examination Planning.
Proceedings of the Constraint Processing, Selected Papers, 1995

1993
Solving a real life exams problem using CHIP.
Proceedings of the Logic Programming, 1993


  Loading...