S. Abdul, T., M. Motair, H., Razaq, (2018). On the Two Machine Permutation Flowshop Scheduling Problems Using Variable Neighborhood Search Algorithms. , 5(1), 0-0.
T. S. Abdul; H. M. Motair; Razaq. "On the Two Machine Permutation Flowshop Scheduling Problems Using Variable Neighborhood Search Algorithms". , 5, 1, 2018, 0-0.
S. Abdul, T., M. Motair, H., Razaq, (2018). 'On the Two Machine Permutation Flowshop Scheduling Problems Using Variable Neighborhood Search Algorithms', , 5(1), pp. 0-0.
S. Abdul, T., M. Motair, H., Razaq, On the Two Machine Permutation Flowshop Scheduling Problems Using Variable Neighborhood Search Algorithms. , 2018; 5(1): 0-0.

On the Two Machine Permutation Flowshop Scheduling Problems Using Variable Neighborhood Search Algorithms

Almuthanna Journal of Pure Science (MJPS)
Article 1, Volume 5, Issue 1, 2018, Pages 0-0
Authors
T. S. Abdul; H. M. Motair;
Abstract
This paper considers the two machine permutation flow shop scheduling problem PFSSP. We study
some special cases of the problem
Keywords
Permutation flow shop; non; dominated solutions; lexicographical order; variable neighborhood; simulated annealing; descend method
Statistics
Article View: 51
PDF Download: 29


Journal Management System. Powered by iJournalPro.com