MétaCan
Menu
Back to cohort
Record W3003378510 · doi:10.5267/j.jpm.2020.1.002

A genetic algorithm-based method for solving multi-mode resource-constrained project scheduling problem in uncertain environment

2020· article· en· W3003378510 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
venuePublished in a venue whose home country is Canada.

Bibliographic record

VenueJournal of Project Management · 2020
Typearticle
Languageen
FieldDecision Sciences
TopicResource-Constrained Project Scheduling
Canadian institutionsDouglas College
Fundersnot available
KeywordsComputer scienceGenetic algorithmMathematical optimizationScheduling (production processes)Distributed computingMathematicsMachine learning

Abstract

fetched live from OpenAlex

Project scheduling models with resource constraints and multi-mode activities aims to create a schedule for carrying out activities considering precedence constraints and available resources in order to minimize the project duration. In the real world, we face uncertainty related to projects, where there are no historical data, hence, we should rely on the experts' judgements to estimate activity durations. For this purpose, in this paper, the 99-simulation method is used to deal with uncertainty. The exact mathematical programming model is presented in this paper and the hybrid algorithm based on Genetic Algorithm is used to solve this type of project scheduling problem which finds the near-optimal solution in a short computational time. Finally, the effectiveness of the proposed model is examined with a numerical example.

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 imitation

Not 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.

metaresearch head score (Codex)0.010
metaresearch head score (Gemma)0.002
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.493
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0100.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.002
Science and technology studies0.0000.000
Scholarly communication0.0010.000
Open science0.0020.000
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.122
GPT teacher head0.399
Teacher spread0.277 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it