A Lower Bound Guided Hierarchical Approach for a Two-Stage Scheduling Problem.
Jiaxi WuYe LiangLeyuan ShiPublished in: CASE (2023)
Keyphrases
- lower bound
- scheduling problem
- np hard
- upper bound
- single machine
- permutation flowshop
- strongly np hard
- flowshop
- branch and bound algorithm
- setup times
- branch and bound
- randomly generated test problems
- optimal solution
- worst case
- search algorithm for solving
- processing times
- minimizing makespan
- sufficiently accurate
- lower bounding
- tabu search
- earliness tardiness
- linear programming
- objective function
- linear programming relaxation
- precedence constraints
- hierarchical model
- upper and lower bounds
- lower and upper bounds
- competitive ratio
- special case
- sample complexity
- unrelated parallel machines
- lot sizing
- integer programming
- constraint satisfaction problems