Minimizing total completion time for re-entrant flow shop scheduling problems.
Caixia JingWanzhen HuangGuochun TangPublished in: Theor. Comput. Sci. (2011)
Keyphrases
- flowshop
- scheduling problem
- processing times
- single machine
- sequence dependent setup times
- setup times
- flowshop scheduling
- maximum lateness
- total tardiness
- bicriteria
- total weighted tardiness
- minimizing makespan
- release dates
- np hard
- total flowtime
- makespan minimization
- asymptotic optimality
- single machine scheduling problem
- precedence constraints
- minimizing total tardiness
- parallel machines
- tabu search
- job shop
- permutation flowshop
- polynomially solvable
- job shop scheduling
- unrelated parallel machines
- flowshop scheduling problems
- identical machines
- resource consumption
- special case
- genetic algorithm
- preventive maintenance
- completion times
- job shop scheduling problem
- open shop