An efficient method for the open-shop scheduling problem using simulated annealing
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 test...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | conferenceObject |
| Published: |
2016
|
| Online Access: | http://hdl.handle.net/10725/7656 http://dx.doi.org/10.1007/978-3-319-32467-8_102 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://link.springer.com/chapter/10.1007%2F978-3-319-32467-8_102 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|