{"id":"W2611857909","doi":"10.1137/16m1086819","title":"A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fondo Nacional de Desarrollo Científico y Tecnológico; National Science Foundation","keywords":"Knapsack problem; Mathematics; Approximation algorithm; Combinatorics; Polynomial-time approximation scheme; Scheduling (production processes); Algorithm; Time complexity; Cover (algebra); Discrete mathematics; Job shop scheduling; Schedule; Mathematical optimization; Computer science","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002168259,0.001748214,0.001869789,0.0008904935,0.0007963182,0.001830626,0.002421746,0.001570883,0.005743754],"category_scores_gemma":[0.003444915,0.0008183113,0.001001742,0.001784357,0.0007936935,0.001679275,0.001709491,0.002919823,0.00166814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001742806,"about_ca_system_score_gemma":0.002158641,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00289674,"about_ca_topic_score_gemma":0.003012369,"domain_scores_codex":[0.9989581,0.0003623567,0.00003897051,0.0001918276,0.0002545057,0.0001943064],"domain_scores_gemma":[0.9990327,0.0005582549,0.00007697158,0.000112999,0.0001279009,0.00009114495],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004231753,0.0003203175,0.0005601022,0.0002926463,0.0000813638,0.000101261,0.0001044947,0.840496,0.001464249,0.04423094,0.009650574,0.1022749],"study_design_scores_gemma":[0.00004270663,0.00002971959,0.00003972587,0.000009977683,0.000007393022,0.00002645519,0.00001433671,0.9844288,0.0003029094,0.01388305,0.001210497,0.000004483017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01272504,0.0006878936,0.9773935,0.0006398694,0.0001621067,0.0001285595,0.0002036849,0.0007508023,0.007308559],"genre_scores_gemma":[0.1930695,0.0004817194,0.7995178,0.0004021097,0.0001489094,0.0003534814,0.0005958775,0.0003067775,0.005123896],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005743754,"threshold_uncertainty_score":0.01921475,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02842515982407755,"score_gpt":0.263090745202883,"score_spread":0.2346655853788054,"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."}}