On the Two Machine Permutation Flowshop Scheduling Problems Using Variable Neighborhood Search Algorithms
Abstract
This paper considers the two machine permutation flow shop scheduling problem PFSSP. We studysome special cases of the problem
Keywords
Permutation flow shop, non-dominated solutions, lexicographical order, variable neighborhood, simulated annealing, descend method.Metrics