Variable neighborhood search algorithms for the permutation flowshop scheduling problem with the preventive maintenance
| Autor: | Wahiba Jomaa, Bassem Jarboui, Mansour Eddaly |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
0209 industrial biotechnology
Numerical Analysis 021103 operations research Job shop scheduling Computer science Strategy and Management 0211 other engineering and technologies Process (computing) Computational intelligence Statistical model 02 engineering and technology Management Science and Operations Research Preventive maintenance Variable (computer science) Permutation 020901 industrial engineering & automation Computational Theory and Mathematics Management of Technology and Innovation Modeling and Simulation Statistics Probability and Uncertainty Algorithm Variable neighborhood search |
| Zdroj: | Operational Research. |
| ISSN: | 1866-1505 1109-2858 |
| DOI: | 10.1007/s12351-019-00507-y |
| Popis: | This paper addresses to the permutation flowshop scheduling problem while considering the preventive maintenance in the non-resumable case. The criterion to be optimized is the makespan. Two variable neighborhood search algorithms are proposed. In the first algorithm, only one initial solution is generated according to a constructive heuristic. In the second algorithm, a learning process using a probabilistic model is introduced to the variable neighborhood algorithm in order to generate the initial solution. The computational results show the high performance of the proposed algorithms according to the compared approaches. Besides, the change of the initial solution during the optimization procedure may improve the performance of the variable neighborhood search algorithm. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink