{"id":"W2103309143","doi":"10.1109/picmet.2001.952246","title":"Calculating the theoretical project completion time of large networks in polynomial processing time","year":2002,"lang":"en","type":"article","venue":"","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Duration (music); Time complexity; Computer science; Polynomial; Mathematical optimization; Computational complexity theory; Mathematics; Algorithm","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.004226292,0.001043021,0.001228821,0.001545243,0.0008903344,0.002363211,0.002041632,0.001081514,0.005212811],"category_scores_gemma":[0.0346847,0.0008635144,0.001277472,0.001678056,0.001735426,0.004074404,0.001453464,0.002326542,0.0008463314],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004145866,"about_ca_system_score_gemma":0.003558623,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01198113,"about_ca_topic_score_gemma":0.01387276,"domain_scores_codex":[0.9981017,0.0006073287,0.00008045403,0.0003428519,0.0004679054,0.000399798],"domain_scores_gemma":[0.9699575,0.02636672,0.001023767,0.001199863,0.0008924539,0.0005597465],"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.0001155305,0.00004651937,0.0008084626,0.0001099139,0.00002799633,0.00004171122,0.00007340212,0.9515291,0.0006676979,0.03041671,0.001035426,0.01512757],"study_design_scores_gemma":[0.0000190609,0.00001211585,0.000196129,0.000007865206,0.000009602618,0.00001434889,0.00001701236,0.9677459,0.000358064,0.03131415,0.0003008119,0.00000503621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1160834,0.0005493941,0.8721825,0.0009917347,0.00004545301,0.0001238718,0.0004529615,0.000812694,0.008757881],"genre_scores_gemma":[0.7286548,0.0007886179,0.2632638,0.0002290555,0.0001483303,0.0004907144,0.001028984,0.0005671046,0.004828634],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01198113,"threshold_uncertainty_score":0.03008044,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06484969735203121,"score_gpt":0.3548422319852788,"score_spread":0.2899925346332476,"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."}}