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

Harmanani, Haidar M.; Bou Ghosn, Steve

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

Harmanani, Haidar M.; Bou Ghosn, Steve

URI: http://hdl.handle.net/10725/7656

URL: https://link.springer.com/chapter/10.1007%2F978-3-319-32467-8_102

DOI: http://dx.doi.org/10.1007/978-3-319-32467-8_102

Date: 2018-04-27

Terms of Use: This item is made available under the terms and conditions applicable to " Conference Paper / Proceeding ", as set forth at: http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php

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.

Citation:

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.