A Branch and Bound Algorithm for Single Machine Scheduling with Two Stages of Failure Process
Notice bibliographique
Résumé
Summary & ConclusionsThe objective of the majority of production planning problems is to find the order of jobs on each machine minimizing functions of the jobs’ processing times, such as makespan and flow time. However, production environment is subject to many sources of uncertainty including machine unavailability periods, which may have a major impact on the production plan. Often times, a production line is interrupted due to periodic repair and preventive maintenance. In addition, machines may become unavailable due to unexpected failures. In many industrial settings unexpected machine failures can be potentially costly as a result of its consequences in terms of machine down times, product quality and client satisfaction. In this context, decision makers may want to jointly optimize the order of the jobs on the machine as well as the maintenance operations considering failures in a production environment such that the total expected makespan is minimized.In this paper, we deal with an integrated optimization model for production scheduling and inspection of a single machine. The failure process of the machine follows a two-stage Delay Time Model (DTM), i.e. it starts with an initial defect, which leads to eventual failure if the defect is left unattended. Once a job is interrupted due to failure on the machine, it must be restarted from the beginning when the machine becomes available. To reduce the risk of machine’s breakdown during processing of the jobs, an inspection can be performed prior to start of any job on the machine which exposes down time to the system. We consider the possibility of either minimal repair or replacement of the machine depending on its age at inspection time. We develop a recursive formula to jointly find the optimal inspection policy and production schedule which minimizes the total expected makespan. The problem defined in this paper might be applicable in many industrial and management contexts. Especially when some objective functions such as makespan is of greater importance for the decision makers. We present the application of our proposed model by use of data from a production line consisting of a multiple spindles boring machines which are able to process a number of jobs. We implement a branch and bound algorithm to optimize the model and then evaluate the efficiency of the branch and bound algorithm. The results of the study indicate the optimal solution depends on the input parameters of the model, most specifically, the down time parameters and the distributions of defect arrival and delay time.
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.
Comment cette classification a été obtenuedéplier
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,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 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,000 | 0,000 |
| 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écouleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule tête enseignante, pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».