{"id":"W2435530825","doi":"10.1007/s10878-016-0044-6","title":"Approximation algorithms for precedence-constrained identical machine scheduling with rejection","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Theory of computation; Rounding; Submodular set function; Computer science; Job shop scheduling; Scheduling (production processes); Approximation algorithm; Mathematical optimization; Linear programming; Algorithm; Mathematics","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.0005792449,0.0001678075,0.0002618694,0.0002313813,0.00009108523,0.0000862644,0.0001284208,0.0001350085,0.00003330162],"category_scores_gemma":[0.0003686202,0.0001167467,0.00008969411,0.0002912707,0.00004246292,0.0006865381,0.000008006221,0.0001306296,0.000001922048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001488121,"about_ca_system_score_gemma":0.00007174522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.906809e-7,"about_ca_topic_score_gemma":1.799842e-7,"domain_scores_codex":[0.9986739,0.00004467344,0.0006234231,0.0001264122,0.0003424695,0.0001891203],"domain_scores_gemma":[0.9986174,0.000168672,0.0003044223,0.0001107107,0.0006887207,0.000110133],"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.0001952397,0.00005322041,0.00005064747,0.00003080409,0.00007441279,0.000001936973,0.00005840401,0.9894516,0.0005364153,0.001487321,0.00002344392,0.008036516],"study_design_scores_gemma":[0.00421058,0.000410882,0.00001564441,0.0001918088,0.00007946313,0.00008054566,0.00004124639,0.9882615,0.004951498,0.001496126,0.00006737876,0.000193337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003171063,0.0001082698,0.992785,0.0002168531,0.003196748,0.0002579245,0.0000068831,0.0001217138,0.0001355108],"genre_scores_gemma":[0.2056403,0.0001459889,0.7933742,0.000009612839,0.0007303126,0.00001527175,0.00001229821,0.00004710299,0.0000249134],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2024692,"threshold_uncertainty_score":0.4760793,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0116746661865757,"score_gpt":0.2380949645483972,"score_spread":0.2264202983618215,"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."}}