{"id":"W2529544702","doi":"10.1007/s10479-016-2336-8","title":"An applicable method for modifying over-allocated multi-mode resource constraint schedules in the presence of preemptive resources","year":2016,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":18,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"University of Calgary","keywords":"Computer science; Schedule; Scheduling (production processes); Operations research; Mathematical optimization; Operating system; Mathematics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.03092602,0.0002030708,0.0004932801,0.001090609,0.0004858337,0.0003414833,0.002595371,0.0001780675,0.0001009468],"category_scores_gemma":[0.02092947,0.0001133579,0.0001662328,0.002044318,0.001316537,0.0006612713,0.0002599427,0.0004036242,0.00001120588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002763608,"about_ca_system_score_gemma":0.0004138039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001168424,"about_ca_topic_score_gemma":0.0007061215,"domain_scores_codex":[0.991067,0.003610305,0.001310652,0.0008560625,0.002427048,0.0007289121],"domain_scores_gemma":[0.9803718,0.01512,0.0002055685,0.001518253,0.002624304,0.0001600309],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001039084,0.001347818,0.007016522,0.00008770683,0.0001287096,0.000008386475,0.03425513,0.1273807,0.6497539,0.06284706,0.001083992,0.115051],"study_design_scores_gemma":[0.00237375,0.001067913,0.005397981,0.0004238769,0.00001307583,0.00001300878,0.05238738,0.6422479,0.2784978,0.01216564,0.004976275,0.0004354007],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6839693,0.0001845668,0.3089229,0.003845401,0.0000135379,0.001870029,0.0002298676,0.00001848227,0.0009458712],"genre_scores_gemma":[0.8875474,0.00003188702,0.1116095,0.00008570228,0.00004702575,0.0004015507,0.00000683958,0.00001963652,0.0002505195],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5148671,"threshold_uncertainty_score":0.9978656,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.4946935409284301,"score_gpt":0.5864833560107651,"score_spread":0.09178981508233497,"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."}}