Algorithms for three-machine flowshop scheduling problem to minimize makespan with uncertain processing times.
Ali AllahverdiMuberra AllahverdiPublished in: RAIRO Oper. Res. (2023)
Keyphrases
- flowshop
- scheduling problem
- processing times
- single machine
- parallel machines
- setup times
- bicriteria
- special case
- minimizing makespan
- sequence dependent setup times
- flowshop scheduling
- minimizing total tardiness
- tabu search
- total tardiness
- number of tardy jobs
- precedence constraints
- makespan minimization
- scheduling jobs
- np hard
- release dates
- maximum lateness
- job shop scheduling problem
- job processing times
- job shop
- total weighted tardiness
- strongly np hard
- permutation flowshop
- completion times
- polynomially solvable
- single machine scheduling problem
- earliness tardiness
- total flowtime
- computational complexity
- objective function
- benchmark problems
- combinatorial optimization