{"id":"W2055312886","doi":"10.1007/s10479-011-1000-6","title":"Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries","year":2011,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Due date; Theory of computation; Polynomial-time approximation scheme; Mathematical optimization; Scheduling (production processes); Computer science; Job shop scheduling; Time complexity; Approximation algorithm; Scheme (mathematics); Mathematics; Algorithm; 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.003594009,0.002574503,0.003088157,0.001669724,0.0009429479,0.002176019,0.003643083,0.002224441,0.003585767],"category_scores_gemma":[0.00747379,0.00190625,0.001230736,0.002513241,0.001028478,0.002691404,0.001229784,0.001652324,0.0004732519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0018931,"about_ca_system_score_gemma":0.002090004,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003671654,"about_ca_topic_score_gemma":0.003698343,"domain_scores_codex":[0.9977733,0.0009110809,0.0001334934,0.0003481528,0.0004721819,0.0003617438],"domain_scores_gemma":[0.9957538,0.002759932,0.0005227299,0.0002068946,0.0004238429,0.0003327666],"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.0004781311,0.0001369899,0.0004203862,0.0003702229,0.0001201803,0.0001443733,0.00005640589,0.9709801,0.003340536,0.006868592,0.001437074,0.015647],"study_design_scores_gemma":[0.00003786118,0.0001465283,0.0003073248,0.00001498668,0.00003270861,0.0000692063,0.00002896712,0.9893476,0.001191885,0.008276175,0.0005302951,0.00001654867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1605864,0.00161961,0.8297866,0.0007617195,0.0004089623,0.0003537052,0.0005385337,0.0004098944,0.005534646],"genre_scores_gemma":[0.7052642,0.001189034,0.2742792,0.000188157,0.0003867784,0.0004004416,0.0006478187,0.0006503417,0.01699411],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003671654,"threshold_uncertainty_score":0.01900715,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1666290049663507,"score_gpt":0.3454053241298946,"score_spread":0.1787763191635439,"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."}}