{"id":"W2144184895","doi":"10.1109/picmet.2001.952313","title":"Calculating the theoretical project completion time of large networks in polynomial time","year":2002,"lang":"en","type":"article","venue":"","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Critical path method; Criticality; Duration (music); Path (computing); Computer science; Mathematical optimization; Project management; Longest path problem; Operations research; Mathematics; Theoretical computer science; Engineering; Shortest path problem; Graph; Computer network; Systems engineering","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004345329,0.001052748,0.001122389,0.001690955,0.0008112179,0.002236235,0.001787557,0.0009831261,0.004741395],"category_scores_gemma":[0.03173982,0.000695893,0.001087039,0.00161645,0.001756012,0.003415576,0.001347036,0.001940242,0.0009977296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004302649,"about_ca_system_score_gemma":0.002674526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006739772,"about_ca_topic_score_gemma":0.00681419,"domain_scores_codex":[0.997926,0.0007099793,0.00007911531,0.0002983717,0.0006107874,0.0003757132],"domain_scores_gemma":[0.9763603,0.02036777,0.0009688798,0.0009164911,0.0009151548,0.0004715107],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000121995,0.00004557537,0.0009610155,0.0001369463,0.00002199667,0.00008701534,0.00009415118,0.9379345,0.0006748034,0.04279176,0.0008943462,0.01623592],"study_design_scores_gemma":[0.00001075077,0.00001347662,0.0001608142,0.00001072434,0.000005836514,0.00002474473,0.00002031885,0.9679968,0.0003246283,0.03098297,0.0004441912,0.000004689422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06228028,0.0004972677,0.9267987,0.0006284008,0.00003256902,0.0001048378,0.0002534873,0.0005015149,0.008902897],"genre_scores_gemma":[0.6415859,0.001113222,0.3491103,0.0001909062,0.0001384277,0.0005752101,0.0007619155,0.0004570523,0.006066957],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006739772,"threshold_uncertainty_score":0.03121805,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06570568339862448,"score_gpt":0.351189822817973,"score_spread":0.2854841394193485,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}