{"id":"W1968885544","doi":"10.1016/s0304-3975(03)00141-5","title":"On polynomial-time approximation algorithms for the variable length scheduling problem","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University; University of Lethbridge","funders":"","keywords":"Approximation algorithm; Mathematics; Algorithm; Extension (predicate logic); Approximation error; Scheduling (production processes); Polynomial-time approximation scheme; Variable (mathematics); Discrete mathematics; Combinatorics; Computer science; Mathematical optimization; Mathematical analysis","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.00388973,0.0001740134,0.0001626521,0.0001441567,0.001005038,0.00088719,0.001910163,0.00005422862,0.00006306524],"category_scores_gemma":[0.0003497236,0.0001152359,0.00005977938,0.001208455,0.0009754163,0.00064101,0.0002866872,0.0001979291,0.00009192948],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006698177,"about_ca_system_score_gemma":0.0002617422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001239655,"about_ca_topic_score_gemma":4.255991e-8,"domain_scores_codex":[0.9976172,0.0001636341,0.0002788551,0.0006594496,0.0006486111,0.0006322049],"domain_scores_gemma":[0.9976789,0.001020426,0.00007802677,0.0007372751,0.0002893123,0.0001960635],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005056211,0.00005723159,6.336284e-7,0.000005856737,0.000004224315,3.080514e-7,0.0001850297,0.03939682,0.000238426,0.9462867,0.0001414225,0.01367828],"study_design_scores_gemma":[0.0002878521,0.0001874856,0.000002957714,0.00001668158,0.000002885526,0.000007706201,0.000003440277,0.794229,0.001492495,0.203099,0.0005327253,0.0001377067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001640143,0.00001528051,0.9890692,0.001736695,0.0003833933,0.0007422594,0.00000154564,0.0001784346,0.007709126],"genre_scores_gemma":[0.1393297,0.00000324564,0.8595841,0.0008679079,0.00006900813,0.00005686034,0.000001039845,0.00001016621,0.00007799782],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7548322,"threshold_uncertainty_score":0.8555194,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01607593935933372,"score_gpt":0.2594672765588951,"score_spread":0.2433913371995614,"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."}}