{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01283925,0.001364103,0.002135154,0.001173381,0.001201746,0.001427651,0.003939535,0.002908079,0.003999194],"category_scores_gemma":[0.03340796,0.001528452,0.00174041,0.00193787,0.001713749,0.004969502,0.001426347,0.003148639,0.0003764112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003136082,"about_ca_system_score_gemma":0.003231372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01371333,"about_ca_topic_score_gemma":0.009089305,"domain_scores_codex":[0.9953288,0.003015312,0.0002227412,0.0004474558,0.0004854377,0.0005003483],"domain_scores_gemma":[0.8857548,0.100724,0.002427343,0.005910451,0.003730648,0.001452891],"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.002850364,0.001820469,0.003181115,0.0002467539,0.00008516746,0.00003347356,0.00008989174,0.9738488,0.0007173499,0.003807928,0.0008547508,0.01246393],"study_design_scores_gemma":[0.000165575,0.0002338079,0.0004490814,0.00000649051,0.00002127614,0.000007749853,0.00002820685,0.9974903,0.0003416018,0.001181153,0.0000641899,0.00001049957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.8745717,0.00080969,0.1184457,0.0003604738,0.0001052888,0.0003486382,0.0006448757,0.0005525348,0.004161139],"genre_scores_gemma":[0.9189747,0.000156165,0.07859866,0.00005736969,0.00002684692,0.0002498484,0.0008197897,0.00007154612,0.00104496],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.01371333,"threshold_uncertainty_score":0.06790131,"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."}}