{"id":"W2090543144","doi":"10.1145/2344422.2344430","title":"An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Tardiness; Due date; Scheduling (production processes); Job shop scheduling; Mathematical optimization; Computer science; Retard; Mathematics; Schedule; Medicine; Operating system","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":[],"consensus_categories":[],"category_scores_codex":[0.0001585499,0.0002307543,0.0002317229,0.00006918195,0.0001930317,0.00003948697,0.0002720081,0.00009808653,0.0001919095],"category_scores_gemma":[0.00001235943,0.0001596074,0.0000935993,0.0003588659,0.00007422245,0.0002941918,0.000003111594,0.0001836011,0.00001822703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000311967,"about_ca_system_score_gemma":0.00002146995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003077373,"about_ca_topic_score_gemma":0.000009666903,"domain_scores_codex":[0.9989735,0.00002702171,0.0002665684,0.000186568,0.0002041558,0.0003422245],"domain_scores_gemma":[0.9988767,0.0002774128,0.00005019737,0.0005411161,0.0001259816,0.0001286019],"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.0004079454,0.00157246,0.001352192,0.0003356742,0.001430257,0.000004782559,0.003328374,0.663873,0.000884955,0.0002664843,0.0003378003,0.3262061],"study_design_scores_gemma":[0.001936047,0.0002366508,0.002800353,0.00007242519,0.0003437789,0.0001129828,0.0008482606,0.9788173,0.01332048,0.00009714044,0.0008419468,0.0005725874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0328402,0.00009448821,0.9652341,0.000156787,0.0005436023,0.0004700968,0.0002051562,0.0002971575,0.0001584307],"genre_scores_gemma":[0.617838,0.00001587397,0.3814513,0.00001836732,0.000155485,0.0002434075,0.0000559627,0.00006305471,0.0001585963],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5849977,"threshold_uncertainty_score":0.6508602,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01328662680028864,"score_gpt":0.2519840459485223,"score_spread":0.2386974191482337,"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."}}