Improved Flow Shop Schedules with Total Completion Time Criterion.
Dipak LahaDhiren Kumar BeheraPublished in: ICCSA (3) (2013)
Keyphrases
- scheduling problem
- flowshop
- total flowtime
- single machine
- processing times
- flowshop scheduling problems
- permutation flowshop
- setup times
- minimizing makespan
- flowshop scheduling
- job processing times
- np hard
- completion times
- tabu search
- sequence dependent setup times
- unrelated parallel machines
- makespan minimization
- asymptotic optimality
- maximum lateness
- job shop
- parallel machines
- total weighted tardiness
- precedence constraints
- strongly np hard
- special case
- job shop scheduling
- single machine scheduling problem
- job shop scheduling problem
- search algorithm