Flowshop scheduling problem to minimize total completion time with random and bounded processing times.
Yuri N. SotskovAli AllahverdiTsung-Chyan LaiPublished in: J. Oper. Res. Soc. (2004)
Keyphrases
- processing times
- scheduling problem
- flowshop
- single machine
- release dates
- parallel machines
- setup times
- sequence dependent setup times
- makespan minimization
- total weighted tardiness
- tabu search
- single machine scheduling problem
- np hard
- minimizing makespan
- polynomially solvable
- job shop scheduling problem
- precedence constraints
- number of tardy jobs
- production scheduling
- special case
- competitive ratio
- job processing times
- resource consumption
- identical parallel machines
- upper bound
- feasible solution
- multistage
- lower bound
- objective function