Production rate control of an unreliable manufacturing cell with adjustable capacity
Bibliographic record
Abstract
This article addresses the production control problem of an adjustable capacity unreliable manufacturing cell responding to a single product type demand. The manufacturing cell is composed of an unreliable machine, called the ‘central machine’. Due to availability fluctuations, the central machine may fall short of meeting the long-term demand rate. In order to quickly adjust the production capacity and thus meet the demand, a reserve machine is called upon in support if the finished product inventory level drops below a specific threshold. Such a machine involves higher production costs compared with the central one. This article aims to determine the optimal production control policy for the involved machines in order to minimise production, inventory and backlog costs over an infinite horizon. This article proposes a continuous dynamic programming formulation of the problem and adopted a numerical scheme to solve the optimality conditions equations. The optimal production policy is shown to be described by a state dependent hedging point policy (SDHPP). To determine the optimal control policy parameters, an experimental approach based on design of experiments, simulation modelling, and response surface methodology is proposed. Several sensitivity analyses have been carried out and have shown the robust behaviour of the developed policy facing expected variations of the system parameters. The results also show that the proposed SDHPP policy outperforms classical stand-by and parallel machines based control policies. The usefulness of the proposed approach is outlined for more complex situations where the system must deal with non-exponential failure and repair time distributions.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".