MétaCan
Menu
Back to cohort
Record W1988393189 · doi:10.1115/imece2004-59279

Function-Block Enabled Job Shop Planning and Control With Uncertainty

2004· article· en· W1988393189 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.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicScheduling and Optimization Algorithms
Canadian institutionsNational Research Council Canada
Fundersnot available
KeywordsJob shopDynamismComputer scienceFixtureFunction (biology)Process (computing)Block (permutation group theory)Flow shop schedulingControl (management)Industrial engineeringOperations researchJob shop schedulingEngineeringArtificial intelligenceMathematics

Abstract

fetched live from OpenAlex

The objective of this research is to develop a methodology of distributed process planning and its execution control for job shop operations. The manufacturing processes of job shop operations are rather complex, especially at shop floors where highly mixed products in small batch sizes are handled simultaneously. In addition to the fluctuating job shop operations, unpredictable events like job delay, urgent job insertion, fixture shortage, missing tool, and even machine break-down, are regularly challenging the job shop operations. Targeting the fluctuations, this research proposes a DPP (distributed process planning) approach to generate process plans that are responsive and adaptive to the changes. In this paper, a function block enabled approach is introduced. It is expected that the new approach can largely enhance the dynamism of fluctuating job shop operations.

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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.787
Threshold uncertainty score0.294

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.006
GPT teacher head0.191
Teacher spread0.185 · 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

Quick stats

Citations4
Published2004
Admission routes1
Has abstractyes

Explore more

Same topicScheduling and Optimization AlgorithmsFrench-language works237,207