Efficient solutions to the m-machine robust flow shop under budgeted uncertainty.
Mario LevoratoDavid SoteloRosa FigueiredoYuri FrotaPublished in: Ann. Oper. Res. (2024)
Keyphrases
- flowshop
- bicriteria
- efficient solutions
- scheduling problem
- special case
- sequence dependent setup times
- tabu search
- flowshop scheduling
- processing times
- minimizing makespan
- setup times
- manufacturing cell
- bi objective
- asymptotic optimality
- unrelated parallel machines
- strongly np hard
- single machine
- maximum lateness
- parallel machines
- ant colony optimization
- neural network
- lot streaming
- dynamic programming
- np hard
- optimal solution