{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009658328,0.00009594661,0.0001631913,0.0002622719,0.00009853754,0.0001415051,0.000169024,0.0001001057,0.0002768572],"category_scores_gemma":[0.0002539574,0.00009573946,0.00008292501,0.0004586736,0.00008179853,0.0004417997,0.00002815351,0.0002045593,0.00008940902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001447431,"about_ca_system_score_gemma":0.0001086698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003276467,"about_ca_topic_score_gemma":0.000009307897,"domain_scores_codex":[0.9987982,0.00007259965,0.0003817991,0.0001867826,0.0003131593,0.0002474388],"domain_scores_gemma":[0.9990084,0.0001422199,0.000008343769,0.000237032,0.0005083592,0.00009562328],"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.00007849202,0.0005072904,0.00009529215,0.0009771921,0.0002753788,0.000004707203,0.002415383,0.9410515,0.02963228,0.009913185,0.009738693,0.005310539],"study_design_scores_gemma":[0.0002151159,0.00004740925,0.00004867342,0.000059369,0.00000447313,0.000001839107,0.0001513422,0.9856833,0.0132094,0.00006368259,0.000423152,0.00009224578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4220379,0.0008244771,0.5715234,0.001053897,0.0002367606,0.001189871,0.0003691845,0.0003334772,0.002431087],"genre_scores_gemma":[0.1551595,0.0001450976,0.8418506,0.00002452961,0.0001518002,0.0001811837,0.0002958468,0.00005400415,0.002137374],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2703273,"threshold_uncertainty_score":0.3904142,"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."}}