No-wait flowshop scheduling problem with two criteria; total tardiness and makespan.
Ali AllahverdiHarun AydilekAsiye AydilekPublished in: Eur. J. Oper. Res. (2018)
Keyphrases
- total tardiness
- flowshop
- scheduling problem
- single machine
- sequence dependent setup times
- processing times
- setup times
- flowshop scheduling
- minimizing makespan
- bicriteria
- tabu search
- np hard
- makespan minimization
- maximum lateness
- parallel machines
- special case
- permutation flowshop
- total flowtime
- minimizing total tardiness
- flowshop scheduling problems
- total weighted tardiness
- job shop scheduling problem
- release dates
- strongly np hard
- maximum tardiness
- lot streaming
- precedence constraints
- unrelated parallel machines
- preventive maintenance
- single machine scheduling problem
- job processing times
- identical parallel machines
- search procedure
- linear programming
- search algorithm