| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 482640 | European Journal of Operational Research | 2009 | 7 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Boris Detienne, Laurent Péridy, Éric Pinson, David Rivreau,
