{"id":"W2163482281","doi":"10.1061/41109(373)109","title":"A New Approach for Resource-Constrained Multi-Project Scheduling","year":2010,"lang":"en","type":"article","venue":"","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; Schedule; Mathematical optimization; Scheduling (production processes); Benchmark (surveying); Job shop scheduling; Resource constraints; Minification; Dynamic priority scheduling; Distributed computing; Mathematics","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":["metaresearch","metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.007781283,0.0004734238,0.0006994945,0.0009471352,0.000492548,0.001056396,0.002169206,0.0004404049,0.001417513],"category_scores_gemma":[0.01623108,0.0003501345,0.0005599177,0.001610686,0.0003346997,0.0004617742,0.000289439,0.0008872987,0.0002934752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003083625,"about_ca_system_score_gemma":0.0008752023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001494691,"about_ca_topic_score_gemma":0.0000894336,"domain_scores_codex":[0.9943131,0.0002057442,0.001380277,0.00162408,0.001482817,0.0009939816],"domain_scores_gemma":[0.9938411,0.003167617,0.0004416137,0.001625634,0.0004348131,0.0004892489],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006977403,0.0005449576,0.007192893,0.00006594197,0.0002497344,0.00002249859,0.007468213,0.004122965,0.1139598,0.05089649,0.03248701,0.7822917],"study_design_scores_gemma":[0.008472569,0.0002219232,0.0005057898,0.00003052454,0.00009864807,0.0003474289,0.01931972,0.760271,0.01195629,0.007503536,0.1894699,0.001802703],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03620864,0.00002772443,0.8705809,0.000675132,0.0004069452,0.001543599,0.00002972975,0.0003558149,0.09017157],"genre_scores_gemma":[0.1613386,7.210819e-7,0.8227639,0.0004264691,0.0006487974,0.00009049592,0.0000211405,0.00005690077,0.01465303],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.780489,"threshold_uncertainty_score":0.9999806,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1678831879597019,"score_gpt":0.4077449622411281,"score_spread":0.2398617742814262,"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."}}