Minimizing total tardiness in a two-machine flowshop with uncertain and bounded processing times.
Muberra AllahverdiPublished in: RAIRO Oper. Res. (2023)
Keyphrases
- minimizing total tardiness
- processing times
- flowshop
- scheduling problem
- sequence dependent setup times
- single machine
- setup times
- special case
- makespan minimization
- total weighted tardiness
- bicriteria
- release dates
- tabu search
- number of tardy jobs
- np hard
- polynomially solvable
- precedence constraints
- single machine scheduling problem
- resource consumption
- competitive ratio
- job shop scheduling problem
- lower bound
- parallel machines
- job processing times
- simulated annealing
- search space