MétaCan
Menu
Back to cohort

A nonlinear model for optimizing the performance of a multi-product production line

2011· article· en· W1971378748 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 Transactions in Operational Research · 2011
Typearticle
Languageen
FieldEngineering
TopicScheduling and Optimization Algorithms
Canadian institutionsLaurentian UniversityUniversity of Windsor
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsWorkstationThroughputComputer scienceBlocking (statistics)Production lineReduction (mathematics)Production (economics)Buffer (optical fiber)Line (geometry)Nonlinear systemProduct (mathematics)Parallel computingMathematical optimizationOperating systemComputer networkMathematicsEngineering

Abstract

fetched live from OpenAlex

This paper examines the measures of performance and in particular addresses the throughput of an automated production line processing multiple products. The line is composed of a sequence of workstations connected in series with finite buffers in between. We explore the effects of buffer size on attenuating the impact of line blocking and starvation that can cause a reduction in the output. Such effects are analyzed through a nonlinear mathematical programming model and the implications are examined. The aim of the model is to achieve the best performance subject to available workstation capacity without overexpenditure on buffer size. Single and multi-objective optimizations are carried out in the paper. A numerical example of a production line with a given configuration of workstations; workstation capacity; and job mix is presented to demonstrate the model and its application. A discussion of the impact of buffer size on maximum throughput is also provided. The paper is concluded with a discussion on the decision-making implications.

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: Methods · Consensus signal: none
Teacher disagreement score0.596
Threshold uncertainty score0.295

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.000
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.158
GPT teacher head0.371
Teacher spread0.213 · 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