{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00434999,0.002487275,0.002712794,0.001806641,0.001587053,0.003379857,0.005681116,0.003945362,0.00755349],"category_scores_gemma":[0.01665379,0.001318104,0.001525444,0.00365189,0.001793679,0.006296942,0.002669029,0.004497577,0.001287798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004805888,"about_ca_system_score_gemma":0.004557063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009489343,"about_ca_topic_score_gemma":0.01068593,"domain_scores_codex":[0.9977169,0.0008295646,0.00009627973,0.0003780008,0.0004514717,0.0005277494],"domain_scores_gemma":[0.9901627,0.007182512,0.0006779037,0.0009083907,0.0005172005,0.0005512533],"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.0009618699,0.0004840235,0.001018386,0.0002691262,0.0001091972,0.0000648507,0.0002040837,0.8688956,0.0008893747,0.04306295,0.009661555,0.074379],"study_design_scores_gemma":[0.0001222917,0.00003871085,0.00009492281,0.00001642162,0.00002350937,0.00002345117,0.00003792,0.9668329,0.000134031,0.03208072,0.0005856238,0.000009433707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0493778,0.001976626,0.9334743,0.002307933,0.0003572277,0.0002087722,0.000431424,0.001415477,0.01045041],"genre_scores_gemma":[0.4491746,0.001175403,0.5386847,0.0007870783,0.0004917349,0.0005206487,0.001188988,0.0005937231,0.007383196],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009489343,"threshold_uncertainty_score":0.03486937,"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."}}