2016 | OriginalPaper | Buchkapitel
An Efficient Method for the Open-Shop Scheduling Problem Using Simulated Annealing
verfasst von : Haidar M. Harmanani, Steve Bou Ghosn
Erschienen in: Information Technology: New Generations
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.