Using local search methods to solve two machine flow shop scheduling problem
Author
Source
Issue
Vol. 4, Issue 3 (31 Dec. 2008), pp.71-83, 13 p.
Publisher
University of Thi-Qar Research and Development Department
Publication Date
2008-12-31
Country of Publication
Iraq
No. of Pages
13
Main Subjects
Abstract EN
here are a lot of scheduling problems that have a combinatorial aspect and these problems are difficult to be solved.
Therefore we can use the local search methods to find the optimal solution or near optimal solution.
In this paper we consider the scheduling problem on two machine flow shop to find the minimum value of the objective function (maximum completion time and maximum of tardiness).The main contribution in this work is a branch and bound (BAB) algorithm with optimal solution and some of the local search methods namely descent method (DM), adjacent pairwise interchange method (APIM).
Also, prove some of special cases of which leads to optimal solution.
Since the problem is NP-hard, descent method (DM) and adjacent pairwise interchange method (APIM) are proposed to solve the problem efficiency.
American Psychological Association (APA)
Abd al-Abbas, Wafa. 2008. Using local search methods to solve two machine flow shop scheduling problem. University of Thi-Qar Journal،Vol. 4, no. 3, pp.71-83.
https://search.emarefa.net/detail/BIM-276298
Modern Language Association (MLA)
Abd al-Abbas, Wafa. Using local search methods to solve two machine flow shop scheduling problem. University of Thi-Qar Journal Vol. 4, no. 3 (Dec. 2008), pp.71-83.
https://search.emarefa.net/detail/BIM-276298
American Medical Association (AMA)
Abd al-Abbas, Wafa. Using local search methods to solve two machine flow shop scheduling problem. University of Thi-Qar Journal. 2008. Vol. 4, no. 3, pp.71-83.
https://search.emarefa.net/detail/BIM-276298
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references : p. 82-83
Record ID
BIM-276298