Bibliographic record
Abstract
This paper presents a model designed to integrate the planning and scheduling phases of highway construction projects, focusing primarily on the planning aspects. The model automatically generates the work breakdown structure (WBS) and precedence network respecting job logic and stores a list of construction operations typically encountered in highway projects. The generated network can subsequently be modified to suit the unique requirements of the project being considered. An object-oriented model is developed for planning highway construction operations. The model employs resource-driven scheduling in order to suit the repetitive nature of this class of projects. It accounts for (1) resource availability; (2) multiple preceding and succeeding activities; (3) transverse obstructions; (4) activities with varying quantities of work along the highway length; (5) the impact of inclement weather on crew productivity; and (6) the beneficial effect of the learning curve. At the core of the model is a relational database designed to store available resources and their respective unavailability periods. The model enables both: (1) activities executed by own force; and (2) activities subcontracted out. The model is incorporated in a prototype software that operates in the Microsoft Windows environment and generates schedules in both graphical and tabular formats. An example project is analyzed to demonstrate the features of the developed model.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.006 | 0.001 |
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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".