{"id":"W4391924232","doi":"10.1007/s10479-024-05860-6","title":"A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Theory of computation; Scheme (mathematics); Flow (mathematics); Polynomial-time approximation scheme; Mathematics; Time complexity; Stage (stratigraphy); Computer science; Discrete mathematics; Algorithm; Geometry; Mathematical analysis","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002125858,0.0009456393,0.001780424,0.0006241397,0.00153315,0.002096969,0.003819607,0.00136594,0.005115353],"category_scores_gemma":[0.004542537,0.0009241253,0.00168415,0.001488017,0.0009103852,0.003272656,0.002226627,0.002199017,0.0007244546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002601837,"about_ca_system_score_gemma":0.003387663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007574137,"about_ca_topic_score_gemma":0.01010808,"domain_scores_codex":[0.9986896,0.0002372237,0.00009467366,0.0003466055,0.0003040225,0.0003278886],"domain_scores_gemma":[0.9975863,0.001149957,0.0001662819,0.0006694318,0.0002313036,0.0001967687],"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.001200508,0.0003505268,0.0007945072,0.0002783973,0.00007989098,0.0001472301,0.0002167739,0.7989832,0.009478228,0.04104834,0.005006848,0.1424156],"study_design_scores_gemma":[0.00005740679,0.00004801473,0.00006967066,0.000004994144,0.00001696356,0.00001933386,0.00001510699,0.988335,0.000937418,0.009966413,0.0005232521,0.000006441378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06375241,0.0001731047,0.9291487,0.0003328918,0.00009240876,0.0002058153,0.0002496662,0.001259481,0.004785602],"genre_scores_gemma":[0.3942123,0.0001269176,0.6008782,0.000100424,0.00007181659,0.0002254169,0.0004363112,0.0001784928,0.003770115],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007574137,"threshold_uncertainty_score":0.01887769,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2199977720889789,"score_gpt":0.4612305012646664,"score_spread":0.2412327291756875,"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."}}