Minimizing total earliness and tardiness on a permutation flow shop using VNS and MIP.
Rym M'HallahPublished in: Comput. Ind. Eng. (2014)
Keyphrases
- completion times
- single machine scheduling problem
- flowshop
- scheduling problem
- single machine
- processing times
- tabu search
- sequence dependent setup times
- variable neighborhood search
- open shop
- weighted sum
- mixed integer programming
- feasible solution
- release dates
- special case
- setup times
- branch and bound algorithm
- lot streaming
- maximum lateness
- precedence constraints
- combinatorial optimization
- lagrangian relaxation
- minimizing makespan
- mathematical programming
- unrelated parallel machines
- metaheuristic
- np hard
- computational complexity
- asymptotic optimality
- flowshop scheduling
- flowshop scheduling problems
- queue length
- search procedure
- simulated annealing
- memetic algorithm
- hybrid method
- solution quality
- neural network