A branch-and-cut approach for the distributed no-wait flowshop scheduling problem.
Mustafa AvciMualla Gonca AvciAlper HamzadayiPublished in: Comput. Oper. Res. (2022)
Keyphrases
- scheduling problem
- flowshop
- minimizing makespan
- minimizing total tardiness
- single machine
- processing times
- setup times
- tabu search
- total flowtime
- permutation flowshop
- sequence dependent setup times
- total tardiness
- special case
- np hard
- flowshop scheduling
- distributed systems
- bicriteria
- maximum lateness
- precedence constraints
- makespan minimization
- flowshop scheduling problems
- preventive maintenance
- total weighted tardiness
- unrelated parallel machines
- strongly np hard
- neural network
- release dates
- evolutionary algorithm