An effective hybrid teachinglearning-based optimization algorithm for permutation flow shop scheduling problem
A teachinglearning-based optimization is proposed for flow shop problem. A variable neighborhood search is proposed for fast solution improvement. A simulated annealing is adopted as the local search method of VNS. For the DMU problems, some new upper bounds have been obtained.
permutation flow shop scheduling problem variable neighborhood search simulated annealing teaching-learning-based optimization algorithm makespan maximum lateness