MétaCan
Menu
Back to cohort
Record W1965219379 · doi:10.1287/msom.1070.0178

Just-in-Time Smoothing Through Batching

2008· article· en· W1965219379 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

VenueManufacturing & Service Operations Management · 2008
Typearticle
Languageen
FieldEngineering
TopicAssembly Line Balancing Optimization
Canadian institutionsMemorial University of Newfoundland
FundersKorea Institute of Machinery and Materials
KeywordsSmoothingComputer scienceOperations managementBusinessOperations researchMicroeconomicsEconomicsMathematics

Abstract

fetched live from OpenAlex

This paper presents two methods to solve the production smoothing problem in mixed-model just-in-time (JIT) systems with large setup and processing time variability between different models the systems produce. The problem is motivated by production planning at a leading U.S. automotive pressure hose manufacturer. One method finds all Pareto-optimal solutions that minimize total production rate variation of models and work in process (WIP), and maximize system utilization and responsiveness. These Pareto-optimal solutions are found efficiently in polynomial time with respect to total demand by an algorithm proposed in the paper. The other method relies on Daniel Webster's method of apportionment for production smoothing, which produces periodic, uniform, and reflective production sequences that can improve operations management of the JIT systems. Finally, the paper presents the results of a computational experiment with the two methods.

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: Empirical · Consensus signal: Empirical
Teacher disagreement score0.048
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.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.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.013
GPT teacher head0.213
Teacher spread0.200 · 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