Ant colony method to minimize single machine scheduling problem
Author
Source
Issue
Vol. 6, Issue 3 (31 Dec. 2017), pp.52-57, 6 p.
Publisher
University of Thi-Qar College of Science
Publication Date
2017-12-31
Country of Publication
Iraq
No. of Pages
6
Main Subjects
Natural & Life Sciences (Multidisciplinary)
Abstract EN
The study deal with a single machine scheduling problem where the objective is to find the sequence which it give the optimal or efficient solution for the objective function the sum of discounted weighted completion time and number of tardy jobs.
The optimal solution was found for some special cases.
Ant colony optimization (ACO) using to found an approximate solution.
Results of extensive computational tests show that proposed (ACO) is effective in solving problems up to (1000) jobs at a time less than or equal to (10) minutes.
American Psychological Association (APA)
Araibi, Sami M.. 2017. Ant colony method to minimize single machine scheduling problem. Journal of Thi-Qar Science،Vol. 6, no. 3, pp.52-57.
https://search.emarefa.net/detail/BIM-834328
Modern Language Association (MLA)
Araibi, Sami M.. Ant colony method to minimize single machine scheduling problem. Journal of Thi-Qar Science Vol. 6, no. 3 (Dec. 2017), pp.52-57.
https://search.emarefa.net/detail/BIM-834328
American Medical Association (AMA)
Araibi, Sami M.. Ant colony method to minimize single machine scheduling problem. Journal of Thi-Qar Science. 2017. Vol. 6, no. 3, pp.52-57.
https://search.emarefa.net/detail/BIM-834328
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references : p. 56-57
Record ID
BIM-834328