{"id":"W2760545295","doi":"10.1016/j.tcs.2017.09.018","title":"An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Office of the Vice President for Research and Economic Development, University at Buffalo; Kyushu Institute of Technology; Alberta Innovates - Technology Futures; Office of the Vice President for Research and Economic Development, University of Iowa; Georgia Southern University","keywords":"Scheme (mathematics); Job shop scheduling; Mathematical optimization; Flow (mathematics); Polynomial-time approximation scheme; Mathematics; Computer science; Stage (stratigraphy); Scheduling (production processes); Parallel computing; Algorithm; Approximation algorithm; Biology; Routing (electronic design automation); Geometry; Mathematical analysis; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001990907,0.0008798774,0.001534003,0.0005881722,0.0007604354,0.001090986,0.00249093,0.001131747,0.002010244],"category_scores_gemma":[0.003764813,0.0006333484,0.000947128,0.001107207,0.000686662,0.001225376,0.001174282,0.00139564,0.0002257521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0016386,"about_ca_system_score_gemma":0.002379875,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006056968,"about_ca_topic_score_gemma":0.005205589,"domain_scores_codex":[0.9992317,0.000262644,0.0000347498,0.0001141975,0.0002117589,0.00014484],"domain_scores_gemma":[0.9989457,0.0005518824,0.00009559706,0.0001422589,0.0001672003,0.00009736993],"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.0002853451,0.00006792837,0.0002686932,0.0001120949,0.00003270953,0.00004851068,0.00007134274,0.9489819,0.002325396,0.01263403,0.001118879,0.03405318],"study_design_scores_gemma":[0.00001100696,0.00002922323,0.00004695236,0.0000034903,0.000005925711,0.000007804235,0.000005728959,0.9969056,0.000233474,0.002562578,0.0001851433,0.000003004606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0333436,0.0002387682,0.9639788,0.0001367045,0.00006322817,0.00008164289,0.00007098259,0.0002053415,0.001880835],"genre_scores_gemma":[0.555005,0.0002824214,0.4410449,0.0000886,0.00007355314,0.0002476785,0.0002083243,0.0001034067,0.002946101],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006056968,"threshold_uncertainty_score":0.01204342,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03236869020933152,"score_gpt":0.2974399826415655,"score_spread":0.2650712924322339,"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."}}