MétaCan
Menu
Back to cohort
Record W4399043596 · doi:10.22260/isarc2024/0125

Exploring the Potential of Reinforcement Learning in Pipe Spool Scheduling in Industrial Projects

2024· article· en· W4399043596 on OpenAlexfundno aff
Mohamed ElMenshawy, Lingzi Wu, Brian Gue, Simaan AbouRizk

Bibliographic record

VenueProceedings of the ... ISARC · 2024
Typearticle
Languageen
FieldEngineering
TopicScheduling and Optimization Algorithms
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsReinforcement learningComputer scienceScheduling (production processes)ReinforcementIndustrial engineeringArtificial intelligenceEngineeringOperations managementStructural engineering

Abstract

fetched live from OpenAlex

Pipe spools are key components in industrial projects.Usually, they are built off-site in a fabrication shop and then shipped to the project location for installation.The fabrication shop deals with numerous spools, each designed to specific requirements according to shop drawings.The nature of pipe spools being engineered to order, together with production constraints such as lead time of materials, different processing times, and availability of resources, render the scheduling process within the shop challenging and time-consuming.As such, this research aims to automate the scheduling process by developing a reinforcement learning model that includes an agent that is capable of handling the scheduling process.The proposed model is applied to an illustrative example to investigate the concept of automating the scheduling process.The construction professionals highlight the great potential of the proposed model in the fabrication scheduling process, and its ability to minimize manual intervention.

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.002
metaresearch head score (Gemma)0.005
Version: metacan-v3-hybrid-931329e0061cValidation 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.008
Threshold uncertainty score0.016

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.005
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.047
GPT teacher head0.230
Teacher spread0.183 · 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 designSimulation or modeling
Domainnot available
GenreEmpirical

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

Citations2
Published2024
Admission routes1
Has abstractyes

Explore more

Same venueProceedings of the ... ISARCSame topicScheduling and Optimization AlgorithmsFrench-language works237,207