{"id":"W2963222815","doi":"10.1007/978-3-319-94776-1_18","title":"Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Vertex cover; Combinatorics; Time complexity; Disjoint sets; Job shop scheduling; Flow shop scheduling; Approximation algorithm; Discrete mathematics; Algorithm; Mathematics; Schedule","routes":{"ca_aff":true,"ca_fund":false,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004760012,0.0004716625,0.0004181878,0.0006049767,0.0001924024,0.0002512623,0.0005800932,0.0002399685,0.00004061207],"category_scores_gemma":[0.00004824639,0.0004104084,0.00008960137,0.000408731,0.0003699739,0.0002194751,0.00008298698,0.0004607044,0.00001522566],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001367136,"about_ca_system_score_gemma":0.0001162611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004292086,"about_ca_topic_score_gemma":0.00002548702,"domain_scores_codex":[0.9979535,0.000008438634,0.0003762693,0.0007229979,0.0004789284,0.0004598052],"domain_scores_gemma":[0.9987378,0.0002030942,0.0001144128,0.0004974316,0.0003175187,0.0001297218],"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.000009016434,0.00000655135,0.000003221107,0.00005848017,0.0000216125,0.0000036408,0.0004338814,0.8880228,0.00002560499,0.0001987327,0.000003802395,0.1112127],"study_design_scores_gemma":[0.0006548429,0.0001248966,0.000001506735,0.0003383025,0.00002232124,0.00002784678,6.069645e-7,0.9924626,0.001220116,0.004390599,0.000227503,0.0005288243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00008143626,0.0004884193,0.9964793,0.00006592873,0.001197436,0.0005591819,0.0000257049,0.0003780771,0.000724555],"genre_scores_gemma":[0.004599788,0.00002817908,0.9940843,0.0002055777,0.0007957864,0.00003202497,0.00006972668,0.00009293178,0.00009166489],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1106839,"threshold_uncertainty_score":0.9998348,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01799213227543936,"score_gpt":0.2452845668499694,"score_spread":0.2272924345745301,"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."}}