Zero-One Programming Approach to Determine Optimum Resource Supply under Time-Dependent Resource Constraints
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
Skilled labor is critical to any construction project. The determination of optimum resource supply quantities over different project time periods compounds the resource-constrained project scheduling problem, which has yet to be formally formulated and analytically solved. Previous related research endeavors focused on the allocation of finite quantities of resources in order to arrive at the shortest total duration for a project. The proposed mathematical model is based on the modeling strategy underlying the zero-one programming approach, aiming to generate the optimum resource-constrained schedule under time-dependent resource constraints. Furthermore, a two-stage solution framework is devised to align with critical decision-making processes in current practices of project scheduling and workface planning. The resulting optimum schedule shortens total project duration while streamlining resource supply for each specified time period. An industrial turnaround project serves as the test bed to (1) demonstrate the effectiveness and computational efficiency of the proposed resource scheduling approach; and (2) identify the optimum time-dependent resource availability limits in practical application settings.
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.014 | 0.006 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.002 | 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