MétaCan
Menu
Back to cohort
Record W1992210270 · doi:10.1080/15326340008807592

Inventory management at service facilities for systems with arbitrarily distributed service times

2000· article· en· W1992210270 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueCommunications in Statistics Stochastic Models · 2000
Typearticle
Languageen
FieldBusiness, Management and Accounting
TopicAdvanced Queuing Theory Analysis
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsService (business)QueuePoisson distributionComputer scienceMarkov chainMathematical optimizationOperations researchService levelInventory controlInventory managementService systemValue (mathematics)Operations managementMathematicsBusinessStatisticsComputer networkEngineering

Abstract

fetched live from OpenAlex

This article analyzes an inventory system for service facilities where there is limited waiting space for customers. For service facilities, typically inventory is used during the provision of service. We consider a system with Poisson arrivals, arbitrarily distributed service times and zero leadtimes. Optimal value of the maximum allowable inventory that minimizes the long-run expected cost rate is obtained in an elegant manner. Various examples of service distributions and optimal values for maximum inventory in each of these cases is also presented. Our analysis also yields a closed form expression of the stationary distribution for the embedded Markov chain of an M/G/l finite capacity queue

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.915
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.048
GPT teacher head0.270
Teacher spread0.222 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it