{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003226195,0.0008068263,0.001604129,0.001118331,0.0008285697,0.002524978,0.001345003,0.001300374,0.003634538],"category_scores_gemma":[0.01121872,0.0007594936,0.0005335059,0.001420235,0.0008410211,0.001992055,0.001317833,0.001482696,0.0004858741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002240891,"about_ca_system_score_gemma":0.004016017,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005278697,"about_ca_topic_score_gemma":0.004832122,"domain_scores_codex":[0.9982868,0.0006839744,0.00007548134,0.0003641263,0.0003064385,0.0002832037],"domain_scores_gemma":[0.9967062,0.002258836,0.0002881332,0.0002183539,0.0002961304,0.000232382],"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.0002042615,0.00009995019,0.000365445,0.00005342117,0.00003046614,0.00003857935,0.00004911154,0.9344734,0.001168072,0.03715362,0.002359413,0.02400432],"study_design_scores_gemma":[0.00002875638,0.00002579768,0.0001322827,0.000004798295,0.000006526708,0.00001221135,0.00001807,0.9793926,0.000454957,0.01937163,0.0005468642,0.000005506416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0406577,0.0002686307,0.9487302,0.0007976577,0.0001513989,0.0001058636,0.0001991205,0.0003183676,0.008770985],"genre_scores_gemma":[0.7724667,0.0003427592,0.2175084,0.0001386401,0.0001376082,0.0002469671,0.0002686492,0.0001328154,0.008757589],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005278697,"threshold_uncertainty_score":0.01706195,"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."}}