Solving a real life exams problem using CHIP. - Patrice Boizumault; Yan Delon; Laurent Péridy (ILPS, 1993)

A CLP Approach for Examination Planning. - Patrice Boizumault; Yan Delon; Laurent Péridy (Constraint Processing, Selected Papers, 1995)

Constraint Logic Programming for Examination Timetabling. - Patrice Boizumault; Yan Delon; Laurent Péridy (J. Log. Program., 1996)

Global Constraints for Partial CSPs: A Case-Study of Resource and Due Date Constraints. - Philippe Baptiste; Claude Le Pape; Laurent Péridy (CP, 1998)

A branch and bound to minimize the number of late jobs on a single machine with release time constraints. - Philippe Baptiste; Laurent Péridy; Eric Pinson (Eur. J. Oper. Res., 2003)

Using short-term memory to minimize the weighted number of late jobs on a single machine. - Laurent Péridy; Eric Pinson; David Rivreau (Eur. J. Oper. Res., 2003)

A Branch and Bound Algorithm to Minimize Total Weighted Tardiness on a Single Processor. - Pascal Babu; Laurent Péridy; Eric Pinson (Ann. Oper. Res., 2004)

Elimination Rules for Job-Shop Scheduling Problem. - Jacques Carlier; Laurent Péridy; Eric Pinson; David Rivreau (Handbook of Scheduling, 2004)

Local adjustments: A general algorithm. - Laurent Péridy; David Rivreau (Eur. J. Oper. Res., 2005)

Cut generation for an employee timetabling problem. - Boris Detienne; Laurent Péridy; Eric Pinson; David Rivreau (Eur. J. Oper. Res., 2009)