MétaCan
Menu
Back to cohort
Record W2001381886 · doi:10.1080/00207543.2011.616549

Production planning for a ramp-up process with learning in production and growth in demand

2011· article· en· W2001381886 on OpenAlexaff
C. H. Glock, Mohamad Y. Jaber, Saeed Zolfaghari

Bibliographic record

VenueInternational Journal of Production Research · 2011
Typearticle
Languageen
FieldEngineering
TopicScheduling and Optimization Algorithms
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsProduction (economics)ConstructiveWork (physics)Operations researchWorkforceProcess (computing)GermanEngineeringEconomicsOperations managementComputer scienceMicroeconomicsEconomic growthGeography

Abstract

fetched live from OpenAlex

This paper presents a production-planning model for a manufacturing process that undergoes a ramp-up period with learning in production and growth in demand. The labour production and demand functions assumed in this paper are validated using available empirical data. A mathematical programming model is developed with numerical examples presented. The results of the paper indicate that the total costs of production can be minimised if the facility produces without interruption during the ramp-up phase and if the production and demand rates are synchronised as much as possible. The latter can be achieved by producing with the lowest possible production rate and by frequently re-structuring the workforce assigned to the production line.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation 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: none
Teacher disagreement score0.018
Threshold uncertainty score0.036

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0060.001

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.073
GPT teacher head0.357
Teacher spread0.284 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations53
Published2011
Admission routes1
Has abstractyes

Explore more

Same venueInternational Journal of Production ResearchSame topicScheduling and Optimization AlgorithmsFrench-language works237,207