Group shops scheduling with makespan criterion subject to random release dates and processing times.
Fardin AhmadizarMehdi GhazanfariSeyyed M. T. Fatemi GhomiPublished in: Comput. Oper. Res. (2010)
Keyphrases
- release dates
- processing times
- single machine
- scheduling problem
- single machine scheduling problem
- scheduling jobs
- maximum lateness
- identical parallel machines
- sequence dependent setup times
- release times
- setup times
- job processing times
- earliness tardiness
- identical machines
- total weighted tardiness
- parallel machines
- polynomially solvable
- makespan minimization
- precedence constraints
- flowshop
- competitive ratio
- np complete
- dynamic programming