Genetic algorithm with local search for the unrelated parallel machine scheduling problem with sequence-dependent set-up times.
Saved in:
| Title: | Genetic algorithm with local search for the unrelated parallel machine scheduling problem with sequence-dependent set-up times. |
|---|---|
| Authors: | Yilmaz Eroglu, Duygu1 (AUTHOR) duygueroglu@uludag.edu.tr, Ozmutlu, H. Cenk1 (AUTHOR), Ozmutlu, Seda1 (AUTHOR) |
| Source: | International Journal of Production Research. Oct2014, Vol. 52 Issue 19, p5841-5856. 16p. 6 Diagrams, 10 Charts, 4 Graphs. |
| Subjects: | Parallel scheduling (Computer scheduling), Setup time, Production scheduling, Genetic algorithms, Search algorithms |
| Abstract: | In this paper, a genetic algorithm (GA) with local search is proposed for the unrelated parallel machine scheduling problem with the objective of minimising the maximum completion time (makespan). We propose a simple chromosome structure consisting of random key numbers in a hybrid genetic-local search algorithm. Random key numbers are frequently used inGAs but create additional difficulties when hybrid factors are implemented in a local search. The best chromosome of each generation is improved using a local search during the algorithm, but the better job sequence (which might appear during the local search operation) must be adapted to the chromosome that will be used in each successive generation. Determining the genes (and the data in the genes) that would be exchanged is the challenge of using random numbers. We have developed an algorithm that satisfies the adaptation of local search results into theGAs with a minimum relocation operation of the genes’ random key numbers – this is the main contribution of the paper. A new hybrid approach is tested on a set of problems taken from the literature, and the computational results validate the effectiveness of the proposed algorithm. [ABSTRACT FROM PUBLISHER] |
| Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | In this paper, a genetic algorithm (GA) with local search is proposed for the unrelated parallel machine scheduling problem with the objective of minimising the maximum completion time (makespan). We propose a simple chromosome structure consisting of random key numbers in a hybrid genetic-local search algorithm. Random key numbers are frequently used inGAs but create additional difficulties when hybrid factors are implemented in a local search. The best chromosome of each generation is improved using a local search during the algorithm, but the better job sequence (which might appear during the local search operation) must be adapted to the chromosome that will be used in each successive generation. Determining the genes (and the data in the genes) that would be exchanged is the challenge of using random numbers. We have developed an algorithm that satisfies the adaptation of local search results into theGAs with a minimum relocation operation of the genes’ random key numbers – this is the main contribution of the paper. A new hybrid approach is tested on a set of problems taken from the literature, and the computational results validate the effectiveness of the proposed algorithm. [ABSTRACT FROM PUBLISHER] |
|---|---|
| ISSN: | 00207543 |
| DOI: | 10.1080/00207543.2014.920966 |
