MétaCan
Menu
Back to cohort
Record W1942626595 · doi:10.15439/2015f273

A new benchmark dataset for Multi-Skill Resource-Constrained Project Scheduling Problem

2015· article· en· W1942626595 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.

Bibliographic record

VenueAnnals of Computer Science and Information Systems · 2015
Typearticle
Languageen
FieldDecision Sciences
TopicResource-Constrained Project Scheduling
Canadian institutionsArtificial Intelligence in Medicine (Canada)
Fundersnot available
KeywordsComputer scienceBenchmark (surveying)Scheduling (production processes)HeuristicGreedy algorithmMathematical optimizationJob shop schedulingMachine learningArtificial intelligenceScheduleAlgorithmMathematics

Abstract

fetched live from OpenAlex

In this paper novel project scheduling difficulty estimations are proposed for Multi-Skill Resource-Constrained Project Scheduling Problem (MS-RCPSP). The main goal of introducing the complexity estimations is an attempt of estimation the project complexity before launching the optimization process. What is more, the dataset instance generator is also presented as a tool to create new instances for extending the research area. Furthermore, the dataset proposed in previous works is extended by new instances, described thoroughly and released as a benchmark dataset. The dataset instances are also scheduled using simple heuristic and greedy algorithm in duration-and cost-oriented optimization modes. Finally, a brief summary of investigated methods and potential further research directions is presented.

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.017
metaresearch head score (Gemma)0.003
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesScholarly communication
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.676
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0170.003
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.002
Science and technology studies0.0000.000
Scholarly communication0.0020.008
Open science0.0010.000
Research integrity0.0000.000
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.258
GPT teacher head0.420
Teacher spread0.162 · 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