Maintenance and setup planning in manufacturing systems under uncertainties
Bibliographic record
Abstract
Purpose The purpose of this paper is to find the optimal production and setup policies for a manufacturing system that produces two different types of parts. The manufacturing system consists of one machine subject to random failures and repairs. Reconfiguring the machine to switch production from one type of product to another generates a non-production time and a significant cost. Design/methodology/approach This paper proposes an approach based on the development of optimal production and setup policies, taking into account the possibilities of undertaking the setup for all modes of the machine, and covering them at the end of setup. New optimality conditions are developed in terms of modified Hamilton-Jacobi-Bellman (HJB) equations and recursive numerical methods are applied to solve such equations. Findings The proposed approach led to determine more realistic production rates of both parts and setup sequences for the different modes of the machine that significantly influence the inventory and the system capacity. A numerical example and sensitivity analysis are used to determine the structure of the optimal policies and to show the helpfulness and robustness of the results obtained. Practical implications Following the steps of the proposed approach will provide the control policies for industrial manufacturing systems with setup permitted at all modes of the machine, and when the setup does not necessarily restore the machine to its operational mode. The proposed optimal policy takes into account the stochastic nature of the machine mode at the end of setup and we show that ignoring it leads to non-natural policies and underestimates significantly the safety stock thresholds. Originality/value Considering the assumptions presented in this paper leads to a new structure of the control laws for the production planning of manufacturing systems with setup.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".