Optimal design of series production lines with unreliable machines and finite buffers
Bibliographic record
Abstract
Purpose The purpose of this paper is to formulate a new problem of the optimal design of a series manufacturing production line system, and to develop an efficient heuristic approach to solve it. The optimal design objective is to maximize the efficiency subject to a total cost constraint. Design/methodology/approach To estimate series production line efficiency, an analytical decomposition‐type approximation is used. The optimal design problem is formulated as one of combinatorial optimization where the decision variables are buffers and types of machines. This problem is solved by developing and demonstrating a problem‐specific ant system algorithm. Numerical examples illustrate the effectiveness of the algorithm. Findings It has been found that this algorithm can always find near‐optimal or optimal solutions quickly. The approach developed in this paper for manufacturing lines can be adapted for power systems and telecommunication systems. Originality/value The paper presents a new approach for the optimal design of buffered series production lines. This optimization approach aims at selecting both the machines and the levels of buffers. The paper also develops an efficient solution approach based on the ant system meta‐heuristic.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 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".