{"id":"W1604003500","doi":"10.1016/j.ipl.2020.105959","title":"Approximation ratio of LD algorithm for multi-processor scheduling and the Coffman–Sethi conjecture","year":2020,"lang":"en","type":"preprint","venue":"Information Processing Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo; Wilfrid Laurier University","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Counterexample; Job shop scheduling; Conjecture; Scheduling (production processes); Computer science; Parallel computing; Mathematics; Algorithm; Combinatorics; Discrete mathematics; Mathematical optimization; Embedded system","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005640413,0.001210171,0.002013012,0.001652485,0.001587488,0.003511579,0.003603469,0.002596129,0.007962424],"category_scores_gemma":[0.03333506,0.0005481557,0.001023474,0.002398148,0.002211544,0.005211461,0.001925788,0.004241271,0.001248831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004867011,"about_ca_system_score_gemma":0.004051207,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00378067,"about_ca_topic_score_gemma":0.003377394,"domain_scores_codex":[0.996969,0.001368486,0.00008472549,0.0004609981,0.0005563821,0.0005604349],"domain_scores_gemma":[0.9776486,0.01685537,0.000636437,0.00316224,0.0009991223,0.0006982331],"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.003688335,0.0006829171,0.004769574,0.0006839596,0.0002098795,0.0002212802,0.0004926997,0.4251682,0.008276404,0.3576103,0.04594278,0.1522537],"study_design_scores_gemma":[0.0001076443,0.0000933972,0.0005178127,0.00004260128,0.00004301168,0.0000804636,0.00006594416,0.8463331,0.00195822,0.1488631,0.001875361,0.00001930064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2468127,0.007684091,0.6674852,0.01421933,0.00103894,0.0002052453,0.0008833111,0.002511694,0.05915945],"genre_scores_gemma":[0.8410738,0.001297233,0.146637,0.001509234,0.0004609114,0.0003014808,0.0006807666,0.0005596118,0.007480104],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007962424,"threshold_uncertainty_score":0.03531283,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02114070675591026,"score_gpt":0.2462968426351044,"score_spread":0.2251561358791941,"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."}}