Algorithms for four-machine flowshop scheduling problem with uncertain processing times to minimize makespan.
Muberra AllahverdiAli AllahverdiPublished in: RAIRO Oper. Res. (2020)
Keyphrases
- flowshop
- scheduling problem
- processing times
- single machine
- minimizing total tardiness
- parallel machines
- makespan minimization
- sequence dependent setup times
- setup times
- minimizing makespan
- flowshop scheduling
- maximum lateness
- tabu search
- bicriteria
- special case
- total tardiness
- np hard
- release dates
- identical machines
- number of tardy jobs
- scheduling jobs
- permutation flowshop
- total flowtime
- precedence constraints
- earliness tardiness
- total weighted tardiness
- job shop
- single machine scheduling problem
- strongly np hard
- worst case
- multi objective
- optimization problems
- genetic algorithm
- competitive ratio