{"id":"W2110472530","doi":"10.1287/msom.1060.0139","title":"Optimal Due Date Assignment and Resource Allocation to Minimize the Weighted Number of Tardy Jobs on a Single Machine","year":2007,"lang":"en","type":"article","venue":"Manufacturing & Service Operations Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tardiness; Due date; Computer science; Mathematical optimization; Scheduling (production processes); Function (biology); Job shop scheduling; Allowance (engineering); Operations research; Time complexity; Resource allocation; Operations management; Queue; Mathematics; Economics; Algorithm","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.0003515722,0.0001861251,0.0001441874,0.0001273951,0.0001855788,0.0001128441,0.0001987532,0.00004289629,0.00008948051],"category_scores_gemma":[0.000005124203,0.0001538894,0.00002673866,0.000209133,0.00001385568,0.00008680302,0.0001037287,0.0001108068,0.00004960416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006674927,"about_ca_system_score_gemma":0.000003280542,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006261498,"about_ca_topic_score_gemma":0.00006797511,"domain_scores_codex":[0.9989264,0.00002986354,0.000331887,0.0002375435,0.0002538652,0.000220443],"domain_scores_gemma":[0.999417,0.00004927156,0.00003252582,0.0003781405,0.00003965876,0.00008338096],"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.0000303822,0.00007016918,0.00003238501,0.0000605417,0.00008169845,0.000004605865,0.000771663,0.9916769,0.0001697679,0.00040441,0.0000901778,0.006607356],"study_design_scores_gemma":[0.001562623,0.0000919353,0.01779841,0.0002073384,0.0001780466,0.00001579218,0.002942253,0.8255616,0.1267593,0.00002204498,0.02417294,0.0006877252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5573245,0.00004058968,0.4302738,0.002559768,0.0002030854,0.0007013279,0.00001100089,0.0002063296,0.008679652],"genre_scores_gemma":[0.8074446,0.00001946347,0.1907202,0.0009347732,0.00006457453,0.00005600326,0.00005830851,0.00004089436,0.0006611542],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2501202,"threshold_uncertainty_score":0.6275426,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009263775871631704,"score_gpt":0.2235662710014812,"score_spread":0.2143024951298495,"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."}}