A Hybrid Metaheuristic Approach for Minimizing the Total Flow Time in A Flow Shop Sequence Dependent Group Scheduling Problem.
Antonio CostaFulvio Antonio CappadonnaSergio FicheraPublished in: Algorithms (2014)
Keyphrases
- scheduling problem
- flowshop
- completion times
- hybrid metaheuristic
- tabu search
- single machine
- vehicle routing problem
- scatter search
- path relinking
- processing times
- job processing times
- setup times
- metaheuristic
- flowshop scheduling
- multi objective
- minimizing makespan
- np hard
- makespan minimization
- sequence dependent setup times
- total tardiness
- maximum lateness
- unrelated parallel machines
- parallel machines
- precedence constraints
- special case
- permutation flowshop
- job shop
- weighted sum
- single machine scheduling problem
- ant colony optimization
- strongly np hard
- release dates
- simulated annealing
- combinatorial optimization