Automating Pipe Spool Fabrication Shop Scheduling for Modularized Industrial Construction Projects Using Reinforcement Learning
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.
Bibliographic record
Abstract
Industrial projects are primarily constructed using a modularized and prefabricated approach. Modules are produced in an offsite fabrication shop and then transported to the construction site for installation. Thus, timely and sequence-specific delivery of preassembled construction elements is essential to prevent delays and ensure a smooth construction progress. As such, fabrication shop schedules are crucial for the success of the entire construction project. Unlike a manufacturing fabrication shop, a construction fabrication shop fabricates unique engineer-to-order products, resulting in challenging shop schedules that involve several conditions and constraints, including material availability, processing time, resource availability, and due dates. Further, the manual iterative nature of the scheduling process makes it laborious and time-consuming, especially when it happens on a frequent basis. This paper presents a deep reinforcement learning (DRL) model for automating the scheduling process. The scheduling process is formulated as a Markov decision process (MDP); then, DRL is used to solve the MDP efficiently for a fabrication shop with large state space. The model is tested on a data set from a pipe spool fabrication shop located in Alberta, Canada; the results show that the DRL outperforms the most popular dispatching rules. This study serves as a first attempt, to our best knowledge, to automate the scheduling process using DRL, thus creating a solid foundation for future advancement in automating and optimizing construction scheduling.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it