We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
On the Two Machine Permutation Flowshop Scheduling Problems Using Variable Neighborhood Search Algorithms.
- Authors
Abdul-Razaq, T. S.; Motair, H. M.
- Abstract
This paper considers the two machine permutation flow shop scheduling problem PFSSP. We study some special cases of the problem F2||(Cmax,Σci, Tmax,ΣTi) (P). In the first one, the special cases to find the exact non dominated solutions for problem (P) are based on the relation between processing times ai, bi and the due dates di on machine A and machine B, (i = 1,2, ..., n). In the second one, the special cases are based on the lexicographical order minimization to solve three problems, in each one the primary objective function is maximum completion time (Cmax), while the secondary objective function is one of the objective functions: total completion times (Σ ci), maximum tardiness (Tmax) and total tardiness (Σ Ti), the resulting problems are (P1), (P2), (P3). We propose three algorithms: Variable neighborhood simulated annealing(VNSA), Variable neighborhood descent method(VNDM) and Variable neighborhood with modefied NEH algorithm(VNMNEH). The comparison results show the efficiency of the proposed algorithms. All algorithmes were coded in Matlab programe.
- Subjects
FLOW shop scheduling; SEARCH algorithms; PERMUTATIONS; SIMULATED annealing; LEXICOGRAPHICAL errors
- Publication
AL-Muthanna Journal of Pure Science, 2018, Vol 5, Issue 1, p36
- ISSN
2226-3284
- Publication type
Article
- DOI
10.18081/2226-3284/018-4/36-47