MétaCan
Menu
Back to cohort
Record W4249151868 · doi:10.1504/ijmtm.2020.107310

Grouping and sequencing of machining operations for high-volume transfer lines

2020· article· en· W4249151868 on OpenAlexaff
Soumitra Bhale, Ahmed Azab, M. Fazle Baki

Bibliographic record

VenueInternational Journal of Manufacturing Technology and Management · 2020
Typearticle
Languageen
FieldEngineering
TopicManufacturing Process and Optimization
Canadian institutionsUniversity of Windsor
Fundersnot available
KeywordsMachiningVolume (thermodynamics)EngineeringEngineering drawingManufacturing engineeringComputer scienceMechanical engineeringPhysics

Abstract

fetched live from OpenAlex

Transfer lines are employed for mass production of a fixed product or a very narrow range of product variants.This thesis considers a simple transfer line balancing problem with a focus on process planning and line configuration.Design features of the product are grouped and machining operations are sequenced in an optimal manner.The objective is to minimize the handling time fraction of the cycle time consisting mainly of orientation change time and tool change time.A new MILP model is developed to solve the problem with the aforementioned objectives while respecting a set of constraints, which include cutting tool allocation, tool magazine limit, tool life limit, takt time limit and precedence, inclusion & exclusion constraints.A problem-specific simulated annealing algorithm to solve large problems is also proposed.Numerical experiments are presented to illustrate the functionality of the MILP model and the meta-heuristic with respect to optimality and computation time.

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.000
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Other · Consensus signal: none
Teacher disagreement score0.003
Threshold uncertainty score0.010

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0010.000
Scholarly communication0.0010.001
Open science0.0010.000
Research integrity0.0010.000
Insufficient payload (model declined to judge)0.0030.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.011
GPT teacher head0.217
Teacher spread0.206 · 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 designNot applicable
Domainnot available
GenreOther

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

Citations1
Published2020
Admission routes1
Has abstractyes

Explore more

Same venueInternational Journal of Manufacturing Technology and ManagementSame topicManufacturing Process and OptimizationFrench-language works237,207