Exact solutions for the two-machine robust flow shop with budgeted uncertainty.
Mário LevoratoRosa FigueiredoYuri FrotaPublished in: Eur. J. Oper. Res. (2022)
Keyphrases
- flowshop
- scheduling problem
- sequence dependent setup times
- special case
- bicriteria
- flowshop scheduling
- setup times
- processing times
- minimizing makespan
- tabu search
- maximum lateness
- asymptotic optimality
- unrelated parallel machines
- flowshop scheduling problems
- single machine
- parallel machines
- total weighted tardiness
- strongly np hard
- manufacturing cell
- robust optimization
- job shop scheduling
- lot streaming
- open shop
- job shop
- completion times
- precedence constraints
- buffer allocation