{"id":"W3000464179","doi":"10.1007/s10951-019-00633-7","title":"Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments","year":2020,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Multiprocessing; Computer science; Open shop; Scheduling (production processes); Job shop scheduling; Approximation algorithm; Flow shop scheduling; Multiprocessor scheduling; Algorithm; Mathematical optimization; Parallel computing; Flow (mathematics); Mathematics; Routing (electronic design automation)","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006859312,0.0004076935,0.0006454218,0.0002251579,0.000191432,0.0005641485,0.0004831764,0.0001248886,0.0001523328],"category_scores_gemma":[0.0002337247,0.0003515494,0.0001072572,0.0005923172,0.00006576724,0.001100824,0.0001630254,0.000881522,0.00001987851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001126884,"about_ca_system_score_gemma":0.0001643692,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001183297,"about_ca_topic_score_gemma":0.000002697288,"domain_scores_codex":[0.9975867,0.00008691953,0.0008921122,0.0003662819,0.0006490187,0.0004189563],"domain_scores_gemma":[0.9984399,0.000106985,0.0003638692,0.0002151295,0.0002977351,0.0005763746],"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.0002176191,0.00007558792,0.0009761226,0.00009786715,0.0002048177,0.0001233062,0.00249406,0.988977,0.002602389,0.00008747682,0.00001131888,0.004132483],"study_design_scores_gemma":[0.004804912,0.0003085582,0.00002456812,0.0002300731,0.00007438418,0.0001580814,0.003332991,0.9837164,0.006697171,0.00002534967,0.0002052528,0.0004223171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3940495,0.001881406,0.60165,0.0008661081,0.000317758,0.0003300901,0.00001291737,0.000165283,0.0007269806],"genre_scores_gemma":[0.3649132,0.0001124049,0.6340333,0.0003854013,0.0004065233,0.000007879433,0.00001171902,0.00008279017,0.00004673236],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03238335,"threshold_uncertainty_score":0.9998937,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04372960983289673,"score_gpt":0.3190339961306103,"score_spread":0.2753043862977136,"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."}}