Local search methods for the flowshop scheduling problem with flowtime minimization.
Quan-Ke PanRubén RuizPublished in: Eur. J. Oper. Res. (2012)
Keyphrases
- flowshop
- scheduling problem
- flowshop scheduling
- processing times
- single machine
- bicriteria
- sequence dependent setup times
- minimizing makespan
- total tardiness
- setup times
- minimizing total tardiness
- maximum lateness
- special case
- total flowtime
- permutation flowshop
- parallel machines
- flowshop scheduling problems
- objective function
- makespan minimization
- np hard
- precedence constraints
- job shop scheduling problem
- tabu search
- total weighted tardiness
- memetic algorithm
- unrelated parallel machines
- preventive maintenance
- strongly np hard
- maximum tardiness
- dispatching rule