{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006348896,0.0003116336,0.0003758343,0.000149874,0.0006595043,0.0007941813,0.0003767295,0.0001431335,0.00003621381],"category_scores_gemma":[0.0003342428,0.000264345,0.0001914293,0.0000726794,0.00005975957,0.0003996173,0.00004177162,0.0004083925,0.00002995148],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001130348,"about_ca_system_score_gemma":0.00002991371,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.152235e-7,"about_ca_topic_score_gemma":0.000001032074,"domain_scores_codex":[0.9983501,0.00002014332,0.0006287201,0.0001942494,0.0004017821,0.0004050086],"domain_scores_gemma":[0.9986291,0.000117068,0.0004275158,0.0004580227,0.0001758389,0.0001924746],"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.00004353691,0.0007320404,0.0000459123,0.001605907,0.00067561,0.00004275875,0.004917752,0.7769971,0.002984365,0.00616685,0.0005189555,0.2052692],"study_design_scores_gemma":[0.001084642,0.0001648614,0.000009744907,0.0004385072,0.00006310795,0.0001222736,0.0002243241,0.9909512,0.002492642,0.003693726,0.0004146198,0.0003402994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005699877,0.000243428,0.9895967,0.000299517,0.0008013931,0.0004617523,0.00004100137,0.0002204899,0.002635851],"genre_scores_gemma":[0.04629768,0.00007310583,0.9525666,0.00003739999,0.0005311093,0.00004008634,0.00003141492,0.0001169232,0.0003056388],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2139541,"threshold_uncertainty_score":0.9999809,"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."}}