Optimal Control Policy for a Two-Phase M/M/1 Unreliable Gated Queue under N-Policy with a Fuzzy Environment
Bibliographic record
Abstract
The two-phase service models analyzed by several authors considered only the probabilistic nature of the queue parameters with fixed cost elements. But the queue parameters and cost elements will be in general are of both possibilistic and probabilistic in nature. Analyzing the performance of the queueing systems with fuzzy environment facilitates to investigate for the possibilistic interval estimates to the performance measures of a queueing system rather than point estimates. In this work, it is proposed to construct membership function of the fuzzy cost function to obtain confidence estimates for some performance measures of a controllable two-phase service single server Markovian gated queue with server startups and breakdowns under N-policy in which the queue parameters viz. arrival rate, startup rate, batch service rate, individual service rate, repair rate and cost elements are all defined as fuzzy numbers. Based on Zadeh’s extension principle and the α-cuts, a set of parametric nonlinear programming problems are developed to find the upper and lower bounds of the minimum total expected cost per unit time at the possibility level α. As the analytical solutions of the nonlinear programming problems developed for the proposed model are tedious, considering the system parameters and cost elements as trapezoidal fuzzy numbers, numerical results for the lower and upper bounds of the optimal threshold N* and the minimum total expected cost per unit time are computed using the nonlinear programming solver available in MATLAB.
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.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 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".