Multi-Objective Simulated Annealing for a Maintenance Workforce Scheduling Problem: A Case Study
Pourquoi ce travail est dans la base
Une base qui oublie comment elle a trouvé un travail ne peut pas être vérifiée. Voici les voies qui ont admis celui-ci.
Notice bibliographique
Résumé
In this chapter, we proposed a multi-objective simulated annealing (MOSA) algorithm to solve a real maintenance workforce scheduling problem (MWSP) with the aim of simultaneously minimizing the workforce cost and the flow time of the work requests. The latter objective is equivalent to the maximization of the equipment availability because by increasing the flow time of a work request the unscheduled shutdown of the corresponding asset will increase too. Workforces have different proficiencies and are grouped into a number of teams called “Field Groups†(or FG for short). Labour requirements are provided from internal and external resources as regular time, overtime and contract. We use a MOSA algorithm introduced in the literature namely Suppapitnarm-MOSA to solve the MWSP. In this method, an archive set stores all the non-dominated/Pareto solutions between each of the multiple objectives. The acceptance probability of a new solution depends on whether or not it is added to the set of potentially Pareto optimal set. However, all objectives affect the acceptance probability of a non-improver solution. The developed MOSA uses the swapping adjacent pair strategy to explore the feasible solution. One of the main differences between the current study and previous ones is that we consider the precedence relations between FGs to do a given work request, in addition to the traditional interference relations between work requests that must be scheduled for a given FG. This extra assumption is a big obstacle to generating the feasible or neighbourhood solutions. Hence, the single solution-based meta-heuristics such as SA or Tabu search seem to be the unique alternatives to solve this problem. This is because population-based operators, such as crossover in Genetic Algorithm, lead to infeasible solutions most of the time. To overcome this drawback, we introduce a recursive-sequential approach to construct the sequence of works for each FG with the aim of identifying the infinite loops resulting from consecutive interference and precedence relations. Because the Pareto optimal set cannot be obtained in real-sized problems, a lower bound was developed separately for each objective function and the obtained Pareto front is compared with these lower bounds. The obtained results show that the developed MOSA is a robust method to solve the MWSP. Our reasoning is that the developed MOSA always converges to a small region of the feasible space, very close to the lower bound of one of the objective functions while the relative difference between the obtained results and the lower bound of another objective function doesn’t increase significantly when the size of the problem increases.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,000 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,001 | 0,001 |
| Méta-épidémiologie (sens large) | 0,001 | 0,000 |
| Bibliométrie | 0,000 | 0,000 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,000 |
| Science ouverte | 0,000 | 0,000 |
| Intégrité de la recherche | 0,001 | 0,001 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découle