A Branch and Bound Algorithm for the Two-Machine Blocking Flowshop Group Scheduling Problem.
Sen ZhangBin QianRong HuChang-Sheng ZhangKun LiPublished in: ICIC (1) (2023)
Keyphrases
- flowshop
- scheduling problem
- branch and bound algorithm
- np hard
- precedence constraints
- strongly np hard
- lower bound
- minimizing total tardiness
- processing times
- flowshop scheduling
- sequence dependent setup times
- setup times
- single machine
- minimizing makespan
- bicriteria
- total tardiness
- permutation flowshop
- branch and bound
- optimal solution
- special case
- shortest processing time
- parallel machines
- tabu search
- lower bounding
- upper bound
- total flowtime
- makespan minimization
- single machine scheduling problem
- maximum lateness
- release dates
- flowshop scheduling problems
- unrelated parallel machines
- combinatorial optimization
- linear programming
- total weighted tardiness
- integer programming
- approximation algorithms
- job shop scheduling problem
- np complete
- lagrangian relaxation
- linear program
- preventive maintenance
- identical parallel machines
- knapsack problem
- multi objective