Institutional Repository
Using simulated annealing and ant-colony optimization algorithms to solve the scheduling problem
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Chmeit, Nader | |
| dc.date.accessioned | 2022-11-03T09:53:07Z | |
| dc.date.available | 2022-11-03T09:53:07Z | |
| dc.date.issued | 2012-07 | |
| dc.identifier.citation | Chmeit, N. (2012). Using simulated annealing and ant-colony optimization algorithms to solve the scheduling problem (Master's thesis, Notre Dame University-Louaize, Zouk Mosbeh, Lebanon). Retrieved from http://ir.ndu.edu.lb/123456789/1626 | en_US |
| dc.identifier.uri | http://ir.ndu.edu.lb/123456789/1626 | |
| dc.description | M.S. -- Faculty of Natural and Applied Sciences, Department of Computer Science, Notre Dame University, Louaize, 2012; "A thesis submitted in partial fulfillment of the requirements for the degree of Master of Science in Computer Information Science."; Includes bibliographical references (leaves 51-55). | en_US |
| dc.description.abstract | The scheduling problem is one of the most challenging problems faced in many different areas of everyday life. This problem can be formulated as a combinatorial optimization problem, and it has been solved with various methods using heuristics and intelligent algorithms. We present in this research an efficient solution to the scheduling problem using two different heuristics namely Simulated Annealing and Ant Colony Optimization. A study comparing the performances of both solutions is described and the results are analyzed. | en_US |
| dc.format.extent | 55 leaves : illustrations | |
| dc.language.iso | en | en_US |
| dc.publisher | Notre Dame University-Louaize | en_US |
| dc.rights | Attribution-NonCommercial-NoDerivs 3.0 United States | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/us/ | * |
| dc.subject.lcsh | Simulated annealing (Mathematics) | |
| dc.subject.lcsh | Computational techniques | |
| dc.subject.lcsh | Swarm intelligence | |
| dc.subject.lcsh | Scheduling | |
| dc.title | Using simulated annealing and ant-colony optimization algorithms to solve the scheduling problem | en_US |
| dc.type | Thesis | en_US |
| dc.rights.license | This work is licensed under a Creative Commons Attribution-NonCommercial 3.0 United States License. (CC BY-NC 3.0 US) | |
| dc.contributor.supervisor | Challita, Khalil, Ph.D. | en_US |
| dc.contributor.department | Notre Dame University-Louaize. Department of Computer Science | en_US |
Files in this item
The following license files are associated with this item:
This item appears in the following Collection(s)
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 United States