MétaCan
Menu
Back to cohort

Centralized and hierarchical scheduling frameworks for copper smelting process

2022· article· en· W4281697569 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

VenueComputers & Chemical Engineering · 2022
Typearticle
Languageen
FieldEngineering
TopicProcess Optimization and Integration
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsScheduling (production processes)Computer scienceScheduleProcess (computing)Distributed computingMathematical optimizationIndustrial engineeringEngineeringMathematics

Abstract

fetched live from OpenAlex

Optimal scheduling of copper smelting process is an ongoing challenge due to conflicting objectives of the various process units and the inter-dependencies that exist among these units. To design a scheduling framework, two potential alternatives – centralized and hierarchical approaches – can address those inter-dependencies in this process. These approaches represent the two extremes and the choice depends on the accuracy, reliability, and complexity of the scheduling task. In this study, optimization-based centralized and hierarchical scheduling frameworks are developed to find an optimal schedule for the smelting process, considering the inter-dependencies among process units. We propose a practical and effective coordination scheme for the hierarchical framework that finds a near-optimal schedule with reasonable computational demands. Two case studies are presented to demonstrate that the proposed hierarchical framework is capable of finding a near plant-wide optimum for the copper smelting process and it can be used in similar plant-wide scheduling applications.

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.767
Threshold uncertainty score0.700

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.001
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.005
GPT teacher head0.212
Teacher spread0.207 · 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