{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002914285,0.001318005,0.00194021,0.0008886419,0.000496403,0.0008672655,0.00146231,0.0007143026,0.00116808],"category_scores_gemma":[0.005306821,0.0004904512,0.001187326,0.001292469,0.0007499069,0.001009799,0.0005901199,0.001228386,0.0002018998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007952175,"about_ca_system_score_gemma":0.002120859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003659109,"about_ca_topic_score_gemma":0.002259188,"domain_scores_codex":[0.9981093,0.0005923623,0.0001356089,0.0004413145,0.0005293378,0.0001919513],"domain_scores_gemma":[0.9970762,0.001633005,0.000430398,0.0002057317,0.0004566662,0.0001980243],"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.00005875035,0.00004548192,0.0004820819,0.00006709385,0.00002320208,0.00005820105,0.00002457949,0.9751354,0.003014043,0.003692057,0.0003743373,0.01702479],"study_design_scores_gemma":[0.00001259036,0.00006291802,0.0001378091,0.000003063113,0.000007982097,0.00001756787,0.000004341778,0.9959461,0.0007039086,0.002816872,0.0002806724,0.000006228308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05023794,0.0002293812,0.9477302,0.0001196982,0.00005388027,0.000120116,0.00007672346,0.0001690148,0.001263112],"genre_scores_gemma":[0.5319388,0.0003226276,0.4650886,0.0000888321,0.0001052143,0.0002795352,0.0002482474,0.0001601672,0.001767945],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003659109,"threshold_uncertainty_score":0.01541239,"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."}}