{"id":"W2198954614","doi":"10.1016/j.omega.2015.12.006","title":"Optimal coordination of resource allocation, due date assignment and scheduling decisions","year":2016,"lang":"en","type":"article","venue":"Omega","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Scheduling (production processes); Computer science; Due date; Resource allocation; Assignment problem; Resource consumption; Single-machine scheduling; Time complexity; Polynomial-time approximation scheme; Regular polygon; Job shop scheduling; Deadline-monotonic scheduling; Operations research; Dynamic priority scheduling; Mathematics; Algorithm; Rate-monotonic scheduling; Schedule","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.000170331,0.00007270624,0.00009336261,0.00008436463,0.00004170254,0.00001712387,0.00006672634,0.00004762239,0.00002725209],"category_scores_gemma":[0.0001452413,0.00005725405,0.00001647242,0.0001279763,0.00002820262,0.0001017839,0.00002162044,0.00003808305,0.00001209321],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002071865,"about_ca_system_score_gemma":0.000009332141,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001175675,"about_ca_topic_score_gemma":5.061121e-7,"domain_scores_codex":[0.999477,0.00001454521,0.0001746854,0.0001106457,0.0001219922,0.000101187],"domain_scores_gemma":[0.9995865,0.000129068,0.0000323093,0.0001391066,0.00005718469,0.00005580336],"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.00001815218,0.00003558936,0.0005543192,0.00002074174,0.00005429368,0.000002204407,0.0003407963,0.9000322,0.01747594,0.002540703,0.0005206615,0.07840437],"study_design_scores_gemma":[0.001524336,0.0000592718,0.002607176,0.0002651891,0.0000333565,0.00001421851,0.0002770718,0.9271857,0.05850782,0.0001616731,0.009025857,0.0003383642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2695366,0.0001537917,0.7287284,0.0004226052,0.00009361182,0.00006356199,0.000006700026,0.0001020605,0.0008926971],"genre_scores_gemma":[0.8828716,0.00006331668,0.1167025,0.00001379503,0.00003612922,0.000007562011,0.000007265594,0.00001545904,0.0002823675],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.613335,"threshold_uncertainty_score":0.2334752,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01297310040881851,"score_gpt":0.2270800008963192,"score_spread":0.2141069004875007,"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."}}