Combinatorial optimization in production and logistics systems

avec FIInternational audienc

Recovering Beam Search Approach for the Multi-Skill Project Scheduling Problem

International audienc

Surgical Case Scheduling with sterilizing activity constraints

International audienc

Benchmark instance indicators and computational comparison of methods

chapter 7This chapter is devoted to extensive computational experiments on the resource-constrained project scheduling problem. Its objective is twofold. First, a selection of representative exact and heuristic methods among the ones presented in the previous chapters are tested and compared under a common experimental framework on four different instance sets. Second, classical and new instance difficulty indicators are evaluated through the experiments and their discriminating power is discussed

Réductions de domaine lagrangiennes pour le problème de minimisation des pénalités d'avance et de retard ponderées sur une machine

Cet article présente de nouvelles règles d\u27élimination pour le problème de minimisation des pénalités d\u27avance et de retard sur une machine, avec ousans dates de disponibilité. Ces règles, basées sur une décomposition lagrangienne, permettent de réduire considérablement les fenêtres d\u27exécution des tâches, et, ainsi, d\u27utiliser efficacement d\u27autres règles d\u27élimination classiques. Les expérimentations montrent que des instances comportant jusqu\u27à 70 tâches sans date de disponiblité, et 40 tâches avec dates de disponibilité, peuvent être résolues optimalement en une heure, en intégrant ces propriétés dans un branch-and-bound

Dynamic Surgical Case Scheduling with sterilizing activities constraints: A rolling horizon approach

National audienc

Cut generation for an employee timetabling problem

Motivated by an industrial application, we study a specific employee timetabling problem. Several investigations are being conducted: a lower bound by Lagrangian relaxation, a heuristic based on a cut generation process and an exact method by Benders decomposition. Experimental results on real and generated instances are reported

Near Optimal and Optimal Solutions for an Integrated Employee Timetabling and Production Scheduling Problem

This paper deals with integrated employee timetabling and production scheduling problem. At the first level, we have to manage a classical employee timetabling problem. At the second level, we aim at supplying a feasible production schedule for a set of interruptible tasks with qualification requirements and time-windows. Instead of using a hierarchical approach, we try here to integrate the two stages and propose an exact method based on a specific decomposition and a cut generation process to solve the resulting problem. This exact two-stage procedure has the double advantage to converge to optimal solutions but also to find quickly near optimal solutions. The relevance of this approach is discussed here through experimental results