Performance analysis of an intelligent manufacturing cell with multi-resource collaboration
Bibliographic record
Abstract
Efficient resource allocation in material handling systems (MHSs) is vital for intelligent manufacturing cells with multi-resource collaboration. The interdependencies among diverse equipment types create complex interactions that increase analytical complexity, especially under stochastic batch transportation where batch sizes depend on buffer jobs and Automated Guided Vehicle (AGV) capacities. Traditional modeling approaches struggle to capture the complex dynamics of multi-level fork/join nodes under these conditions, leaving a gap in effective analysis methods. Here, we develop an open queueing network model with finite buffers, utilizing the Decomposition of State Space Method (DSSM) and Continuous-Time Markov Chain (CTMC) to systematically analyze each node's state. An iterative algorithm is employed to compute the system's performance metrics. We conduct numerical experiments comparing the approximate results of our model with simulation outcomes. Our results demonstrate that the proposed approach accurately and effectively captures the complex dynamics of multi-resource collaborative MHSs, addressing the limitations of traditional methods. This work provides a robust analytical tool for optimizing resource allocation in intelligent manufacturing systems, advancing the field of intelligent manufacturing.
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.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".