Azizi, Nader, Zolfaghari, Saeed, Liang, Ming (2009) Hybrid Simulated Annealing in Flow-shop Scheduling: A Diversification and Intensification Approach. International Journal of Industrial and Systems Engineering, 4 (3). pp. 326-348. ISSN 1748-5037. (doi:10.1504/IJISE.2009.023545) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:29949)
The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. | |
Official URL: http://dx.doi.org/10.1504/IJISE.2009.023545 |
Abstract
In the last few decades, several effective algorithms to solve combinatorial problems have been proposed. However, the challenging nature of these problems restricts the effectiveness of the conventional techniques. This paper presents a generic framework, SAMED, to tackle combinatorial optimisation problems. Based on this framework, a new algorithm tailored for Flow Shop Scheduling, SAMED-FSS, has been developed. The performance of the proposed method has been compared with other techniques including a conventional simulated annealing, a standard genetic algorithm, and a hybrid genetic algorithm. The computational results clearly indicate that the proposed algorithm is much more efficient than the conventional heuristics.
is only available to individual subscribers or to users at subscribing institutions.
Item Type: | Article |
---|---|
DOI/Identification number: | 10.1504/IJISE.2009.023545 |
Subjects: |
H Social Sciences H Social Sciences > H Social Sciences (General) |
Divisions: | Divisions > Kent Business School - Division > Kent Business School (do not use) |
Depositing User: | Catherine Norman |
Date Deposited: | 27 Jul 2012 10:28 UTC |
Last Modified: | 05 Nov 2024 10:12 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/29949 (The current URI for this page, for reference purposes) |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):