{"id":"W2412591217","doi":"10.3390/a9020038","title":"A 3/2-Approximation Algorithm for the Graph Balancing Problem with Two Weights","year":2016,"lang":"en","type":"article","venue":"Algorithms","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Approximation algorithm; Job shop scheduling; Graph; Algorithm; Computer science; Mathematics; Combinatorics; Discrete mathematics; Theoretical computer science","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.001930469,0.002527713,0.002227325,0.001472696,0.001745512,0.002593938,0.003735692,0.003868018,0.009751904],"category_scores_gemma":[0.006596818,0.001081874,0.002400075,0.002915068,0.001015039,0.004513988,0.002999879,0.005205171,0.003503217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003342561,"about_ca_system_score_gemma":0.003963287,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005223747,"about_ca_topic_score_gemma":0.006028931,"domain_scores_codex":[0.9974284,0.0004853042,0.000157093,0.0006614806,0.0006300394,0.0006377087],"domain_scores_gemma":[0.9979451,0.0009119785,0.0001899194,0.0005410828,0.0002156227,0.0001963939],"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.002003583,0.0012383,0.001578964,0.0005877819,0.0002584769,0.0003405843,0.000526434,0.4706071,0.01224513,0.06247427,0.04550836,0.402631],"study_design_scores_gemma":[0.0004102906,0.0001665805,0.0002712608,0.00003956776,0.00004827192,0.0002418675,0.0001012854,0.9262427,0.002149488,0.06446547,0.005830304,0.00003282235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03506842,0.0009421413,0.9448279,0.002119612,0.000418297,0.0004258302,0.0005021066,0.003856302,0.0118394],"genre_scores_gemma":[0.1601595,0.00036199,0.8297544,0.0006877838,0.0002039924,0.0006971699,0.001527677,0.0005936791,0.006013902],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009751904,"threshold_uncertainty_score":0.03262341,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007907320130312992,"score_gpt":0.2129215751676959,"score_spread":0.2050142550373829,"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."}}