Batching and scheduling in a continuous-discrete hybrid flowshop: Lagrangian relaxation-based heuristic algorithms.
Zhaohui LiGuohua WanPublished in: Int. J. Prod. Res. (2023)
Keyphrases
- scheduling problem
- randomly generated test problems
- lagrangian relaxation
- setup times
- flowshop
- total weighted tardiness
- single machine
- lower and upper bounds
- np hard
- dynamic programming
- sequence dependent setup times
- release dates
- parallel machines
- tabu search
- single machine scheduling problem
- strongly np hard
- feasible solution
- processing times
- precedence constraints
- flowshop scheduling
- maximum lateness
- lower bound
- integer programming
- combinatorial optimization
- minimizing makespan
- search algorithm
- branch and bound algorithm
- optimal solution
- lagrangian heuristic
- preventive maintenance
- job shop
- column generation
- linear programming
- upper bound
- cost function