A hybridization of mathematical programming and dominance-driven enumeration for solving shift-selection and task-sequencing problems.
Ada BarlattAmy Mainville CohnOleg Yu. GusikhinPublished in: Comput. Oper. Res. (2010)
Keyphrases
- mathematical programming
- sequencing problems
- combinatorial optimization
- linear programming
- mixed integer linear
- graph search
- tree search
- queueing theory
- mip solver
- optimization approaches
- branch and bound
- controlled tabular adjustment
- vehicle routing problem
- nonlinear programming
- stationary points
- metaheuristic
- branch and bound algorithm
- data quality
- traveling salesman problem
- cell suppression
- search space
- lower bound
- optimal solution
- reinforcement learning