|
|
 |
|
Mardi 2 Février
| Heure: |
12:30 - 13:30 |
| Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
| Résumé: |
A Tabu Search Heuristic for a Staff Scheduling Problem |
| Description: |
Stefania Pan Scheduling problems form a very large class of optimization problems en-
countered in several industries and organizations of widely different kinds. The
particular problem that we consider is a staff scheduling problem, which con-
sists of assigning activities to employees by taking into account workload re-
quirements and different other constraints (for instance legal, economic, or-
ganizational and social constraints). Staff scheduling problems are NP-hard,
heuristics methods are often used to deal with large scale practical problems.
We focus on constraints which impose minimum and maximum duration on
activities. These constraints make the problem difficult to solve. We propose a
Tabu Search (TS) approach to deal with the specific staff scheduling problem
taking into account workload requirements and activities duration constraints.
Computational results show the effectiveness of the proposed approach compar-
ing CPLEX solver. |
| Heure: |
14:00 - 17:00 |
| Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
| Résumé: |
Generating series of the trace group, and Möbius inversion |
| Description: |
Anne Bouillard |
|
|
