An efficient method for the open-shop scheduling problem using simulated annealing

LAUR Repository

Show simple item record

dc.contributor.author Harmanani, Haidar M.
dc.contributor.author Bou Ghosn, Steve
dc.date.accessioned 2018-04-27T11:58:47Z
dc.date.available 2018-04-27T11:58:47Z
dc.date.copyright 2016 en_US
dc.date.issued 2018-04-27
dc.identifier.uri http://hdl.handle.net/10725/7656
dc.description.abstract This paper presents a simulated annealing algorithm in order to solve the nonpreemptive open-shop scheduling problem with the objective of minimizing the makespan. The method is based on a simulated annealing algorithm that efficiently explores the solution space. The method was implemented and tested on various benchmark problems in the literature. Experimental results show that the algorithm performs well on the benchmarks. The algorithm was able to find an optimum solution in many cases. en_US
dc.language.iso en en_US
dc.publisher Springer en_US
dc.title An efficient method for the open-shop scheduling problem using simulated annealing en_US
dc.type Conference Paper / Proceeding en_US
dc.author.school SAS en_US
dc.author.idnumber 199490170 en_US
dc.author.department Computer Science and Mathematics en_US
dc.description.embargo N/A en_US
dc.identifier.doi http://dx.doi.org/10.1007/978-3-319-32467-8_102 en_US
dc.identifier.ctation Harmanani, H. M., & Ghosn, S. B. (2016). An Efficient Method for the Open-Shop Scheduling Problem Using Simulated Annealing. In Information technology: New generations (pp. 1183-1193). Springer, Cham. en_US
dc.author.email haidar.harmanani@lau.edu.lb en_US
dc.conference.date 04 - 06 Apr 2016 en_US
dc.conference.pages 1183-1193 en_US
dc.conference.place Las Vegas, USA en_US
dc.conference.title 13th International Conference on Information Technology en_US
dc.identifier.tou http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php en_US
dc.identifier.url https://link.springer.com/chapter/10.1007%2F978-3-319-32467-8_102 en_US
dc.author.affiliation Lebanese American University en_US
dc.title.volume Information Technology: New Generations en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search LAUR

Advanced Search


My Account