MétaCan
Menu
Back to cohort
Record W2006184182 · doi:10.1080/00207720902961014

An alternative simple solution algorithm of an inventory model with fixed and variable lead time crash costs under unknown demand distribution

2009· article· en· W2006184182 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

VenueInternational Journal of Systems Science · 2009
Typearticle
Languageen
FieldBusiness, Management and Accounting
TopicSupply Chain and Inventory Management
Canadian institutionsConcordia University
Fundersnot available
KeywordsSimple (philosophy)Variable (mathematics)Mathematical optimizationConstraint (computer-aided design)Lead timeCrashComputer scienceDistribution (mathematics)Operations researchMathematicsEngineeringOperations management

Abstract

fetched live from OpenAlex

Inventory models with controllable lead time both for known and unknown demand distributions have been proposed in the literature. A model is useless unless it is formulated correctly and feasible. A simple solution procedure of a model also plays an important role in its application. This article highlights an erroneous formulation of an inventory model developed with fixed and variable lead time crash costs under unknown demand distribution, and also demonstrates its infeasibility. To attain feasibility we extend the model to include a constraint. Then, we present an alternative simple solution technique of the modified model and carry out a comparative study on a numerical example to show its potential significance.

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.001
metaresearch head score (Gemma)0.000
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.394
Threshold uncertainty score0.395

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.004
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.016
GPT teacher head0.254
Teacher spread0.238 · 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