Novel MILP and CP models for distributed hybrid flowshop scheduling problem with sequence-dependent setup times.
Leilei MengKaizhou GaoYaping RenBiao ZhangHongyan SangChaoyong ZhangPublished in: Swarm Evol. Comput. (2022)
Keyphrases
- scheduling problem
- flowshop
- sequence dependent setup times
- single machine
- setup times
- maximum lateness
- minimizing total tardiness
- total tardiness
- total weighted tardiness
- parallel machines
- processing times
- single machine scheduling problem
- precedence constraints
- minimizing makespan
- special case
- np hard
- release dates
- makespan minimization
- job shop scheduling problem
- tabu search
- completion times
- optimal solution
- job shop
- lot sizing
- branch and bound algorithm