{"id":"W2093528244","doi":"10.1016/j.tcs.2005.11.039","title":"Approximation algorithms for minimizing the total weighted tardiness on a single machine","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","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; European Social Fund; Ministry of National Education and Religious Affairs","keywords":"Tardiness; Algorithm; Single-machine scheduling; Computer science; Approximation algorithm; Mathematical optimization; Mathematics; Job shop scheduling","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.0004553786,0.0001261338,0.0001111235,0.00008244644,0.0002687244,0.0001829132,0.0003077245,0.00003642468,0.00001452224],"category_scores_gemma":[0.00002774777,0.00008533792,0.00004578291,0.0004584632,0.0004947017,0.0001122382,0.00004484192,0.00009633353,0.00001148852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004556735,"about_ca_system_score_gemma":0.000011479,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001497328,"about_ca_topic_score_gemma":1.271628e-7,"domain_scores_codex":[0.9990155,0.0000202609,0.0001759299,0.0002280781,0.0002769466,0.0002832864],"domain_scores_gemma":[0.9994152,0.0002004891,0.00002211033,0.0002176005,0.0000890774,0.0000555657],"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.00001352845,0.00006435197,0.000002938886,0.00001377285,0.000005371033,0.000001018331,0.0001429671,0.5108594,0.0008032091,0.4519219,0.00007584834,0.03609572],"study_design_scores_gemma":[0.0002374501,0.00006649022,0.00007137137,0.00001502848,0.000005689972,0.000009075846,0.000006233498,0.9802119,0.008198218,0.01102502,0.00002615619,0.0001274069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02358782,0.00002796794,0.9734371,0.0003281391,0.0006379377,0.0002025153,0.000005962278,0.000268749,0.001503776],"genre_scores_gemma":[0.6571548,4.26848e-7,0.3424825,0.00005795498,0.0002604134,0.00001505684,0.000007761918,0.0000120739,0.000009031423],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.633567,"threshold_uncertainty_score":0.347998,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009993433012399786,"score_gpt":0.2197495770261752,"score_spread":0.2097561440137755,"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."}}