{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005096619,0.0003422506,0.0006184655,0.001265372,0.0001376137,0.0007154121,0.0008054475,0.0001886114,0.0001985196],"category_scores_gemma":[0.001680875,0.0002654634,0.0001147852,0.001925744,0.0000760133,0.0005125753,0.0002122887,0.0004629293,0.0003664839],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007405095,"about_ca_system_score_gemma":0.0002382632,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005716425,"about_ca_topic_score_gemma":0.000002495201,"domain_scores_codex":[0.9955434,0.0003256071,0.0009019215,0.001256801,0.001242593,0.0007297145],"domain_scores_gemma":[0.9971184,0.001661876,0.0001880031,0.0006988031,0.0001053502,0.0002275503],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005889826,0.0004030133,0.1959031,0.0001279942,0.00005065565,0.00006510344,0.01965378,0.7053515,0.02968085,0.001172221,0.00115096,0.04585187],"study_design_scores_gemma":[0.001615173,0.000129581,0.002711523,0.0002000521,0.000008881205,0.00003735943,0.01010187,0.9810362,0.001903994,0.0001447203,0.001505695,0.0006048779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8170087,0.0001147954,0.09418435,0.0003836774,0.0001206352,0.001885194,0.000008280583,0.0001423114,0.08615203],"genre_scores_gemma":[0.6974456,6.242299e-7,0.3012168,0.0005033716,0.00004982673,0.00005241449,0.000005736619,0.00003044985,0.0006952024],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2756848,"threshold_uncertainty_score":0.9999797,"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."}}