{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005476919,0.00007356847,0.0001233551,0.00009105694,0.0001605439,0.00003633488,0.0001236342,0.00003829952,0.0002054347],"category_scores_gemma":[0.00006317881,0.00005024795,0.0000184026,0.0002727524,0.0003251507,0.0001469592,0.00003062043,0.0001539783,0.000005447726],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004110382,"about_ca_system_score_gemma":0.00004275204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002125953,"about_ca_topic_score_gemma":0.00005970925,"domain_scores_codex":[0.9991849,0.00009032388,0.0001964345,0.0001001948,0.0002581506,0.000169999],"domain_scores_gemma":[0.9991637,0.000084617,0.00001328175,0.0001932138,0.0004921686,0.00005295664],"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.0008255285,0.001334901,0.03770994,0.0009910945,0.003119114,0.00007880612,0.1250433,0.6298926,0.03086509,0.1324858,0.00422785,0.03342595],"study_design_scores_gemma":[0.0009687705,0.0003363675,0.01020822,0.0002160071,0.00003362641,0.00005212532,0.008204962,0.6043418,0.3743526,0.000275327,0.0006383908,0.0003718169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9798063,0.0001528471,0.01306809,0.0003797672,0.00002894547,0.0002153486,0.00002656883,0.00002937608,0.006292739],"genre_scores_gemma":[0.9373866,0.0002456009,0.06218894,0.0000142188,0.00001522097,0.00002647223,0.000005908985,0.00001217577,0.0001048234],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3434875,"threshold_uncertainty_score":0.2249366,"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."}}