MétaCan
Menu
Back to cohort
Record W2801855295 · doi:10.1139/tcsme-2003-0009

OPTIMAL ASSIGNING MACHINES AND OPERATORS WITH FINITE CAPACITY

2003· article· en· W2801855295 on OpenAlexvenueno aff
Chun‐Hsiung Lan

Bibliographic record

VenueTransactions of the Canadian Society for Mechanical Engineering · 2003
Typearticle
Languageen
FieldEngineering
TopicManufacturing Process and Optimization
Canadian institutionsnot available
Fundersnot available
KeywordsComputer scienceMathematical optimizationOperator (biology)FixtureReliability (semiconductor)Product (mathematics)Profit (economics)IdleReliability engineeringEngineeringMathematicsMechanical engineering

Abstract

fetched live from OpenAlex

To reach maximal profit, the decision tool for determining the number of machines assigned to an operator and how many operators are required in the production project undergoing the considerations of the related costs, machine reliability, conformity rate of products, variable sales price, finite machines and finite operators are proposed in this study. For an idle or breakdown machine, the fixture cost is charged but no operation cost is considered. With the concept described above, the applicability of this study is extended. In addition, product holding cost and machine repair cost are also considered and addressed into this study for applying closer to the implementation of real industrial cases. The step-by-step algorithm to search the optimal solution is also well developed in this study. This paper surely contributes a newer and more practical technique for decision makers in assigning operators and machines into the production project.

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 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 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.889
Threshold uncertainty score0.373

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.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.008
GPT teacher head0.171
Teacher spread0.163 · 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 teacher head, not a consensus.

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

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

Citations0
Published2003
Admission routes1
Has abstractyes

Explore more

Same venueTransactions of the Canadian Society for Mechanical EngineeringSame topicManufacturing Process and OptimizationFrench-language works237,207