Reentrant flow shop with identical jobs and makespan criterion.
Elad ShufanTal GrinshpounEhud IkarHagai IlaniPublished in: Int. J. Prod. Res. (2023)
Keyphrases
- flowshop
- total flowtime
- scheduling problem
- permutation flowshop
- minimizing makespan
- processing times
- special case
- flowshop scheduling problems
- flowshop scheduling
- bicriteria
- setup times
- sequence dependent setup times
- maximum lateness
- strongly np hard
- total tardiness
- asymptotic optimality
- open shop
- lot streaming
- tabu search
- single machine
- makespan minimization
- unrelated parallel machines
- parallel machines
- total weighted tardiness
- completion times
- job processing times
- np hard
- job shop scheduling
- job shop
- precedence constraints
- upper bound