{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005484814,0.002544864,0.002791962,0.00193158,0.002163485,0.004278007,0.004934859,0.002916987,0.00954586],"category_scores_gemma":[0.02321817,0.001143207,0.001775401,0.005040485,0.00239573,0.009245046,0.003081579,0.005545771,0.002170631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005128111,"about_ca_system_score_gemma":0.005432124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01434583,"about_ca_topic_score_gemma":0.0146727,"domain_scores_codex":[0.9960743,0.001444209,0.0001737342,0.0006391319,0.0008797121,0.0007889494],"domain_scores_gemma":[0.9852753,0.01143278,0.0006765597,0.001455199,0.0006945104,0.000465734],"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.00189628,0.0008122934,0.001219858,0.0005109204,0.0001857048,0.00009707245,0.0004318003,0.5750553,0.002532134,0.1388112,0.02771193,0.2507356],"study_design_scores_gemma":[0.0002975551,0.00008975949,0.000184026,0.00003947473,0.0000594142,0.00004241119,0.00009052287,0.859037,0.0005990236,0.1361375,0.003402406,0.00002098798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03016667,0.003369949,0.9452551,0.002939638,0.0004821198,0.0002048786,0.0003391827,0.001818157,0.0154243],"genre_scores_gemma":[0.2760889,0.003119668,0.704874,0.001190429,0.0007216834,0.0004683659,0.001413168,0.0009325856,0.01119117],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01434583,"threshold_uncertainty_score":0.03720725,"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."}}