Hierarchical Scheduling: Conceptual and Implementation Issues
Bibliographic record
Abstract
The differing information requirements of the various stakeholders in a construction project and the inability of current scheduling systems to address this issue has been a topic of considerable research both in the commercial as well as academic arenas. The current solutions to this issue include the use of hammocks (summary activities) or providing all stakeholders with shared access to the project schedule. There are, however, some deeper more practical issues relevant to the construction industry, that still remain to be addressed. These we think can only be meaningfully addressed by the use of hierarchical scheduling. This is an exploratory paper that seeks firstly to motivate research in the area of hierarchical scheduling by highlighting the several advantages it could offer, and secondly to describe conceptual and implementation challenges that need to be addressed in this regard.
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.024 | 0.037 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.003 |
| Science and technology studies | 0.002 | 0.005 |
| Scholarly communication | 0.006 | 0.012 |
| Open science | 0.006 | 0.003 |
| Research integrity | 0.003 | 0.004 |
| Insufficient payload (model declined to judge) | 0.011 | 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".