Éric Pinson
YOU?
Author Swipe
View article: Comparison of three classical lower bounds for the Parallel Machines Scheduling Problem
Comparison of three classical lower bounds for the Parallel Machines Scheduling Problem Open
This paper compares three classical lower bounds for the Parallel Machines Scheduling Problem (PMSP). The first lower bound considered is the makespan of Jackson’s Pseudo Preemptive Schedule (JPPS). The second is the preemptive bound, whic…
View article: Solving an integrated job-shop problem with human resource constraints
Solving an integrated job-shop problem with human resource constraints Open
This paper investigates the integration of the employee timetabling and production scheduling problems. At the first level, we have to manage a classical employee timetabling problem. At the second level, we aim at supplying a feasible pro…
View article: A set packing approach for scheduling passenger train drivers: the French experience
A set packing approach for scheduling passenger train drivers: the French experience Open
International audience