MétaCan
Menu
Back to cohort
Record W2113659109 · doi:10.1109/nafips.2007.383851

Possible Criticality of Paths in Networks with Imprecise Durations and Time Lags

2007· article· en· W2113659109 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

Venuenot available
Typearticle
Languageen
FieldDecision Sciences
TopicResource-Constrained Project Scheduling
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsFuzzy logicComputer scienceCriticalityInterval (graph theory)Fuzzy numberScheduling (production processes)Mathematical optimizationFuzzy setFuzzy set operationsCritical path methodAlgorithmMathematicsArtificial intelligenceEngineering

Abstract

fetched live from OpenAlex

This paper presents a new fuzzy model for possibly critical paths in the networks with imprecise durations and time lags. We have modified the former presented approaches for this problem by inserting the fuzzy time lags in the scheduling of the projects. To model and solve the fuzzy problem, we first used interval numbers. In fuzzy arithmetic, usually the interval calculations are used for the aim of complexity reduction and simplification. Then, we generate a fuzzy network for project scheduling, where both durations and time lags are fuzzy. To determine the degree of possibly critical paths, we use a linear programming (LP) model. Finally, we test and validate the proposed fuzzy model by presenting a numerical example. The results show that the proposed model is more robust and reliable than the previously generated methods in this area.

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.004
metaresearch head score (Gemma)0.002
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Observational · Consensus signal: Observational
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.228
Threshold uncertainty score0.468

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0040.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.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.041
GPT teacher head0.358
Teacher spread0.317 · 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

Quick stats

Citations9
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicResource-Constrained Project SchedulingFrench-language works237,207