Finance-Based Scheduling for Multiple Projects with Multimode Activities
Bibliographic record
Abstract
Lack of financing and cash deficit is considered as a primary threat to contractor's financial management. Therefore, in case of insufficient cash, many contractors find it difficult to stick with the project schedule leading to extra overhead costs and liquidated damages. Mainly contractors deal with the project scheduling and financing as two independent functions of construction project management. Thus, the main objective of this research is to develop a multi-objective elitist Nondominated Sorting Genetic Algorithm (NSGA-II) for solving finance-based scheduling problem of multi-projects with multi-mode activities. A CPM scheduling model is constructed with its associated cash flow to calculate the values of the multiple objectives. The problem involves the minimization of conflicting objectives: duration of multiple projects, financing costs, and maximum negative cumulative balance. The designed optimization model performs operations of NSGA-II in three main phases: (1) Population initialization; (2) Fitness evaluation; and (3) Generation evolution. An application example is analyzed to illustrate the use of the model and to demonstrate its capabilities in generating optimum solutions. The model can be considered relevant for practitioners to use in large construction projects to make decisions regarding financing.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.003 | 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 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".