MétaCan
Menu
Back to cohort
Record W2159775981 · doi:10.1504/ijor.2008.016159

Optimal management of cross-trained workers, using Markov decision approach

2007· article· en· W2159775981 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueInternational Journal of Operational Research · 2007
Typearticle
Languageen
FieldBusiness, Management and Accounting
TopicAdvanced Queuing Theory Analysis
Canadian institutionsUniversity of Toronto
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsHeuristicsComputer scienceMarkov decision processQueueMathematical optimizationLinear programmingMarkov chainOperations researchQueueing theoryMarkov processOperations managementMathematicsAlgorithmMachine learningStatisticsEconomicsComputer network

Abstract

fetched live from OpenAlex

In this paper, we consider the problem of finding the optimal switching decisions of cross-trained workers between the front and back room. By switching workers from the front room to the back room or vice versa, depending on the size of the queue, management may be able to improve the quality of service. The criterion optimised is minimisation of the expected size of the queue and the primary constraints is ensuring that the work in the back room is completed. The problem is modelled as a Markov decision problem. Solving the problem using Linear Programming (LP) may result in a non-deterministic policy. In that case, we suggest several heuristics; some of them are based on the solution of LP.

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.007
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.184
Threshold uncertainty score0.500

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0070.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0000.002
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.082
GPT teacher head0.434
Teacher spread0.353 · 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