{"id":"W2886895431","doi":"10.1007/s10878-018-0339-x","title":"Approximation algorithms for the graph balancing problem with two speeds and two job lengths","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Job shop scheduling; Approximation algorithm; Combinatorics; Theory of computation; Mathematics; Cardinality (data modeling); Graph; Algorithm; Discrete mathematics; Schedule; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006159426,0.0001585561,0.000217132,0.0001585616,0.0002049184,0.0001571215,0.0001378942,0.00006327929,0.00001130821],"category_scores_gemma":[0.00007484104,0.0001107283,0.00005370215,0.0003583735,0.00007186829,0.0004151581,0.00001293706,0.0001699307,7.861464e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005577164,"about_ca_system_score_gemma":0.00004655164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003623354,"about_ca_topic_score_gemma":0.000001065081,"domain_scores_codex":[0.9989763,0.00003487803,0.0004182006,0.0001072246,0.0002861632,0.0001772337],"domain_scores_gemma":[0.998687,0.0001613543,0.0002428562,0.0001184628,0.0007123889,0.00007793919],"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.00008645717,0.00002072967,0.0001065398,0.00002368602,0.00008724249,7.10853e-7,0.0004631731,0.9933639,0.00004847328,0.002259716,0.0001459135,0.003393521],"study_design_scores_gemma":[0.003759919,0.0003504615,0.00003864923,0.000072589,0.0001085009,0.00005136583,0.0001530394,0.9925163,0.0008072444,0.001793098,0.0001936117,0.0001551547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004218327,0.0002324252,0.9920261,0.0001910381,0.002588823,0.0003405866,0.000002477876,0.00006933824,0.0003309023],"genre_scores_gemma":[0.2183327,0.0001625201,0.7794791,0.00003593018,0.001895221,0.00001476509,0.000007577697,0.00005355831,0.00001861128],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2141144,"threshold_uncertainty_score":0.451537,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009381341884826729,"score_gpt":0.2407579805785749,"score_spread":0.2313766386937482,"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."}}