Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
A HYBRID SIMULATED ANNEALING TO MINIMIZE MAXIMUM COMPLETION TIME IN A PROPORTIONATE FLOW SHOP
- Authors
- Yoon, S.-H.
- Issue Date
- Mar-2022
- Publisher
- ICIC International
- Keywords
- Genetic algorithm; Local search; Maximum completion time; Proportionate flow shop; Simulated annealing
- Citation
- ICIC Express Letters, v.16, no.3, pp.275 - 279
- Journal Title
- ICIC Express Letters
- Volume
- 16
- Number
- 3
- Start Page
- 275
- End Page
- 279
- ISSN
- 1881-803X
- Abstract
- A proportionate flow shop is a special case of flow shops where the processing times of a job are the same on all machines. In this paper, a hybrid simulated annealing (HSA) is proposed for an n-job m-machine proportionate flow shop scheduling problem with one machine of different speeds, in which the objective is to minimize the maximum completion time. HSA is a hybrid approach, which utilizes search diversification of genetic algorithm and search intensification of simulated annealing. Computational tests on randomly generated problems are conducted to evaluate the performance of the HSA. © 2022 ICIC International. All rights reserved.
- Files in This Item
- There are no files associated with this item.
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.