{"id":"W2626322824","doi":"10.1002/nav.21744","title":"Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness","year":2017,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"Program of Shanghai Subject Chief Scientist; National Science Foundation","keywords":"Tardiness; Computer science; Mathematical optimization; Rule-based system; Scheduling (production processes); Due date; Generalization; Heuristic; Flexibility (engineering); Job shop scheduling; Mathematics; Artificial intelligence; Schedule; Statistics","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.00152654,0.0003312686,0.0004541973,0.0002265693,0.0009530252,0.0006685482,0.000772769,0.0001853711,0.00009453627],"category_scores_gemma":[0.002165298,0.0002875065,0.00008319316,0.0002938162,0.0006524481,0.0001982693,0.0003164532,0.00104961,0.0001325765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002128459,"about_ca_system_score_gemma":0.0001477098,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003435916,"about_ca_topic_score_gemma":0.00005730599,"domain_scores_codex":[0.9969438,0.0001406978,0.0004205384,0.0005721207,0.00100705,0.0009158233],"domain_scores_gemma":[0.9971826,0.0005294695,0.00007518207,0.001022157,0.0006520476,0.0005385557],"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.0005532841,0.0002079437,0.01307208,0.0002334848,0.0002233671,0.0002549833,0.0004657533,0.9688301,0.001561899,0.001916655,0.0001798784,0.01250055],"study_design_scores_gemma":[0.001660781,0.0001163139,0.01025157,0.000218132,0.00002750126,0.00003308176,0.0001709665,0.9850011,0.000957494,0.0009613823,0.0001033439,0.0004983566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1744013,0.0002104038,0.81675,0.0005953037,0.0004393355,0.0005553024,0.0001936941,0.0003663931,0.006488299],"genre_scores_gemma":[0.6907833,0.0000404676,0.3086291,0.0000233195,0.0001959351,0.00004247781,0.00005740789,0.0000544177,0.0001735176],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.516382,"threshold_uncertainty_score":0.9999577,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05338562295381413,"score_gpt":0.3591051368220656,"score_spread":0.3057195138682515,"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."}}