Total flow time minimization in a flowshop sequence-dependent group scheduling problem.
Nasser SalmasiRasaratnam LogendranMohammad Reza SkandariPublished in: Comput. Oper. Res. (2010)
Keyphrases
- scheduling problem
- flowshop
- job processing times
- minimizing makespan
- single machine
- processing times
- setup times
- minimizing total tardiness
- completion times
- tabu search
- total tardiness
- flowshop scheduling
- sequence dependent setup times
- bicriteria
- np hard
- special case
- total flowtime
- maximum lateness
- parallel machines
- makespan minimization
- total weighted tardiness
- permutation flowshop
- objective function
- precedence constraints
- release dates
- flowshop scheduling problems
- genetic algorithm
- dynamic programming
- unrelated parallel machines
- search algorithm