MétaCan
Menu
Back to cohort
Record W2019497183 · doi:10.1115/msec2006-21070

Optimal Part Family and Production Module Planning for Reconfigurable Manufacturing Systems

2006· article· en· W2019497183 on OpenAlex
Jian Liu, Derek M. Yip-Hoi, Wencai Wang, Li Tang

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

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicFlexible and Reconfigurable Manufacturing Systems
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsControl reconfigurationFlexibility (engineering)Computer scienceProduction (economics)Genetic algorithmTime to marketProduct (mathematics)Production planningMathematical optimizationReliability engineeringEngineeringEmbedded systemMathematics

Abstract

fetched live from OpenAlex

Manufactures are adopting Reconfigurable Manufacturing Systems (RMS) to better cope with frequently changing market conditions, which place tremendous demands on a system’s flexibility as well as its cost-effectiveness. Considerable efforts have been devoted to the development of necessary tools for the system level design and performance improvement, resulting in approaches to designing a single RMS. In this paper, a methodology for cost-effective reconfiguration planning for multi-module-multi-product RMS’s that best reflect the market demand changes is proposed. Formulated as an optimization procedure, reconfiguration planning is defined as the best reallocation of part families to production modules in an RMS and the best rebalancing of the whole system and each individual module to achieve minimum related cost and simultaneously satisfy the market demand. A Genetic Algorithm (GA) approach is proposed to overcome the computational difficulties caused by the problem complexity. Effectiveness of the proposed methodology is demonstrated with a case study.

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 categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.819
Threshold uncertainty score0.867

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.016
GPT teacher head0.205
Teacher spread0.189 · 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