Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem.
Taha KeshavarzNasser SalmasiMohsen VarmazyarPublished in: Ann. Oper. Res. (2015)
Keyphrases
- scheduling problem
- flowshop
- processing times
- single machine
- minimizing makespan
- flowshop scheduling
- setup times
- maximum lateness
- makespan minimization
- sequence dependent setup times
- tabu search
- np hard
- precedence constraints
- minimizing total tardiness
- total tardiness
- total weighted tardiness
- total flowtime
- bicriteria
- dispatching rule
- special case
- release dates
- permutation flowshop
- parallel machines
- neural network
- polynomially solvable
- strongly np hard
- multistage
- search space
- maximum tardiness
- lot streaming
- flowshop scheduling problems
- preventive maintenance
- competitive ratio