{"id":"W2157120658","doi":"10.1016/j.ejor.2003.06.050","title":"A -approximation algorithm for the two-machine routing open-shop problem on a two-node network","year":2004,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto; The Scarborough Hospital","funders":"Natural Sciences and Engineering Research Council of Canada; Russian Foundation for Basic Research","keywords":"Routing (electronic design automation); Interval (graph theory); Computer science; Node (physics); Job shop scheduling; Mathematical optimization; Approximation algorithm; Upper and lower bounds; Value (mathematics); Open shop; Mathematics; Algorithm; Flow shop scheduling; Combinatorics; Computer network","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.007297324,0.0001337021,0.0001567982,0.0001374687,0.000570312,0.0006117075,0.0006553608,0.00001855034,0.00005204595],"category_scores_gemma":[0.0003232224,0.00009356579,0.00007403139,0.0004143532,0.00004358996,0.0003185642,0.00009470424,0.0006535511,0.00005041831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001578582,"about_ca_system_score_gemma":0.000175421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005855614,"about_ca_topic_score_gemma":0.000003429314,"domain_scores_codex":[0.9979737,0.0003549558,0.0004748061,0.0001489529,0.000711047,0.0003365532],"domain_scores_gemma":[0.998423,0.0004726637,0.00008870166,0.0001735807,0.0007238567,0.0001181575],"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.00003799057,0.00004154703,0.000009074735,0.000005709056,0.00005499306,0.00001538705,0.0002513323,0.9589522,0.00009493474,0.005236308,0.0009432919,0.03435725],"study_design_scores_gemma":[0.002822858,0.0002515608,0.00009519796,0.0001693701,0.00001000798,0.00006871662,0.0001225582,0.9929993,0.0003015705,0.0004943942,0.002543914,0.0001206193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001131744,0.0004085529,0.9862033,0.002549487,0.0003295156,0.0005799001,0.00001238224,0.00003423605,0.008750943],"genre_scores_gemma":[0.227456,0.00009178051,0.7697457,0.0002561894,0.001966173,0.00002235166,0.00002958871,0.0000835547,0.0003486531],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2263243,"threshold_uncertainty_score":0.5898709,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06340619909870253,"score_gpt":0.3467518151207457,"score_spread":0.2833456160220431,"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."}}