A two-phase mathematical-programming heuristic for flexible assignment of activities and tasks to work shifts.
Mahsa ElahipanahGuy DesaulniersÈve Lacasse-GuayPublished in: J. Sched. (2013)
Keyphrases
- mathematical programming
- combinatorial optimization
- variable neighbourhood search
- linear programming
- mixed integer linear
- lower bounding
- tree search
- queueing theory
- optimal solution
- dynamic programming
- optimization approaches
- goal programming
- metaheuristic
- mixed integer linear programming
- traveling salesman problem
- robust optimization
- simulated annealing
- lagrangian relaxation
- search algorithm
- branch and bound algorithm
- feasible solution
- capacity expansion
- constraint satisfaction
- cell suppression
- mip solver
- evolutionary algorithm