A binary-rounding heuristic for multi-period variable-task-duration assignment problems.
Janis L. MillerLori S. FranzPublished in: Comput. Oper. Res. (1996)
Keyphrases
- multi period
- facility location problem
- production planning
- planning horizon
- lot sizing
- approximation algorithms
- data envelopment analysis
- routing problem
- multi item
- mixed integer programming
- mixed integer
- feasible solution
- optimal solution
- total cost
- constraint satisfaction
- linear programming
- facility location
- tabu search
- expected cost
- special case
- multi class
- lot size
- multistage
- continuous variables
- production system
- search strategies