No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan.
Ali AllahverdiHarun AydilekAsiye AydilekPublished in: Appl. Math. Comput. (2020)
Keyphrases
- scheduling problem
- setup times
- minimize total
- flowshop
- single machine
- release dates
- parallel machines
- processing times
- weighted tardiness
- sequence dependent setup times
- total tardiness
- maximum lateness
- total weighted tardiness
- minimizing makespan
- bicriteria
- unrelated parallel machines
- np hard
- precedence constraints
- permutation flowshop
- scheduling jobs
- strongly np hard
- makespan minimization
- single machine scheduling problem
- tabu search
- job shop scheduling problem
- special case
- lower bound
- genetic algorithm