{"id":"W2999291911","doi":"10.1061/9780784482421.074","title":"Path-Float Based Approach to Optimizing Time-Cost Tradeoff in Project Planning and Scheduling","year":2019,"lang":"en","type":"article","venue":"","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Critical path method; Float (project management); Duration (music); Computer science; Mathematical optimization; Scheduling (production processes); Integer programming; Project management; Path (computing); Shortest path problem; Heuristic; Operations research; Network planning and design; Industrial engineering; Engineering; Systems engineering; Algorithm; Mathematics; Artificial intelligence; Computer network; Theoretical computer science","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.001631539,0.001434017,0.001064154,0.001669364,0.0006909588,0.001004267,0.001229522,0.0009804229,0.004911745],"category_scores_gemma":[0.002539754,0.0007988426,0.001112836,0.001800437,0.0008384514,0.001586488,0.000843176,0.001445699,0.0003558932],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001966051,"about_ca_system_score_gemma":0.002348001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009283411,"about_ca_topic_score_gemma":0.008173459,"domain_scores_codex":[0.9993156,0.0002840528,0.00002546725,0.0001284165,0.0001659733,0.00008052684],"domain_scores_gemma":[0.9992129,0.0005123993,0.00009422179,0.00002934983,0.0001192819,0.00003191118],"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.00002700736,0.00002963597,0.0002908071,0.00007896739,0.00002832221,0.00002923842,0.00004491525,0.9587278,0.0005243729,0.01728357,0.0006111591,0.02232414],"study_design_scores_gemma":[0.000006423862,0.00004923493,0.00008209473,0.000010362,0.00001133595,0.00001544504,0.00001614216,0.9872023,0.0002988932,0.01104959,0.001250987,0.000006996544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005909897,0.000162174,0.9905881,0.0001151544,0.00002638948,0.00009053652,0.00006596359,0.00009133838,0.002950356],"genre_scores_gemma":[0.2515843,0.0006891125,0.743046,0.000123825,0.00005593559,0.0005283957,0.0002273165,0.0001702718,0.003574897],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009283411,"threshold_uncertainty_score":0.01845878,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1098890159107446,"score_gpt":0.365682501296937,"score_spread":0.2557934853861924,"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."}}