{"id":"W2090986925","doi":"10.1016/s0196-6774(02)00251-1","title":"A (2+ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective","year":2002,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Approximation algorithm; Open shop; Mathematics; Algorithm; Mathematical optimization; Computer science; Job shop scheduling; Flow shop scheduling","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":[],"consensus_categories":[],"category_scores_codex":[0.0005480985,0.0002445432,0.0003748029,0.000150256,0.0001781247,0.0002669322,0.0005658198,0.0001010627,0.00009796116],"category_scores_gemma":[0.00004273888,0.000153748,0.000136529,0.0003900453,0.00006198096,0.0005842618,0.00004246086,0.0003098476,0.000009344883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001316197,"about_ca_system_score_gemma":0.00004425985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008949107,"about_ca_topic_score_gemma":0.000004015275,"domain_scores_codex":[0.9985694,0.00005055226,0.0005305199,0.0001741211,0.0003766384,0.0002987666],"domain_scores_gemma":[0.9985582,0.0002204716,0.0003021848,0.0002139439,0.0005834793,0.0001217016],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001200224,0.0002641385,0.00003969155,0.00005621869,0.001215335,0.00002620438,0.004944615,0.3788858,0.00009513689,0.000183348,0.006397756,0.6077718],"study_design_scores_gemma":[0.002834538,0.0004280185,0.00005198521,0.0000824384,0.0001435107,0.0001988162,0.0007605726,0.991533,0.001141475,0.0002311057,0.002351141,0.000243419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007605253,0.001458977,0.9944738,0.0004347306,0.0005400076,0.001033841,0.00003244503,0.00007166513,0.001194074],"genre_scores_gemma":[0.002841986,0.0003855425,0.9950391,0.00008771419,0.0006026574,0.0001073653,0.000007628575,0.00007276869,0.0008552127],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6126472,"threshold_uncertainty_score":0.6269662,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02441659351704695,"score_gpt":0.2462396156049676,"score_spread":0.2218230220879206,"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."}}