A New Hybrid Heuristic for Minimizing Total Flow Time in Permutation Flow Shop.
Wikanda PhaphanPublished in: ICIBE (2017)
Keyphrases
- completion times
- flowshop
- scheduling problem
- asymptotic optimality
- tabu search
- unrelated parallel machines
- single machine
- processing times
- strongly np hard
- open shop
- weighted sum
- flowshop scheduling
- setup times
- scheduling jobs
- flowshop scheduling problems
- single machine scheduling problem
- sequence dependent setup times
- maximum lateness
- special case
- job shop scheduling problem
- job shop
- minimizing makespan
- parallel machines
- search procedure
- metaheuristic
- lot streaming
- search algorithm
- memetic algorithm
- simulated annealing
- permutation flowshop
- asymptotically optimal
- np hard
- optimal solution
- initial solution
- solution quality
- sufficient conditions