A hybridization of genetic algorithms and fuzzy logic for the single-machine scheduling with flexible maintenance problem under human resource constraints
Autor: | Belaid Benhamou, Meriem Touat, Fatima Benbouzid-Sitayeb, Sabrina Bouzidi-Hassini |
---|---|
Rok vydání: | 2017 |
Předmět: |
0209 industrial biotechnology
Schedule Mathematical optimization Single-machine scheduling business.industry Computer science 02 engineering and technology Fuzzy logic Maintenance Problem Scheduling (computing) 020901 industrial engineering & automation Genetic algorithm 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Human resources business Software |
Zdroj: | Applied Soft Computing. 59:556-573 |
ISSN: | 1568-4946 |
DOI: | 10.1016/j.asoc.2017.05.058 |
Popis: | This work focuses on the problem of scheduling jobs on a single machine that requires flexible maintenance under human resource competence and availability constraints. To solve the problem we developed two fuzzy genetic algorithms that are based on respectively the sequential and total scheduling strategies. The one respecting the sequential strategy consists in two phases. In the first phase, the integrated production and maintenance schedules are generated. In the second one, the human resources are assigned to maintenance activities. The second algorithm respecting a total strategy consists in generating the integrated production and maintenance schedules that explicitly satisfy the human resource constraints. In regard to these two different strategies, we studied then two integrated fuzzy genetic algorithms that use the fuzzy logic framework to deal with the uncertain nature of both production and maintenance data. The proposed genetic algorithms have been implemented and applied to non-standard test problems which integrate production, maintenance and human resource data. The experimental results show that the consideration of human resource constraints and uncertainties allows to get more realistic and applicable solutions. Moreover, the comparison between the two proposed algorithms shows that the one based on the total strategy outperforms the one based on the sequential strategy regarding the objective functions’ optimization. However, this latter is better in terms of computational times. |
Databáze: | OpenAIRE |
Externí odkaz: |