Minimizing total completion time for flowshop scheduling problem with uncertain processing times.
Muberra AllahverdiAli AllahverdiPublished in: RAIRO Oper. Res. (2021)
Keyphrases
- processing times
- flowshop
- scheduling problem
- single machine
- setup times
- flowshop scheduling
- makespan minimization
- minimizing makespan
- sequence dependent setup times
- release dates
- bicriteria
- permutation flowshop
- total weighted tardiness
- total flowtime
- tabu search
- minimizing total tardiness
- total tardiness
- single machine scheduling problem
- earliness tardiness
- precedence constraints
- number of tardy jobs
- maximum lateness
- scheduling jobs
- job shop
- parallel machines
- polynomially solvable
- np hard
- identical machines
- special case
- strongly np hard
- preventive maintenance
- completion times
- resource consumption
- job shop scheduling problem
- job processing times