{"id":"W4413122925","doi":"10.1016/j.dam.2025.08.004","title":"An efficient polynomial-time approximation scheme for parallel multi-stage open shops","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"Shaanxi Provincial Science and Technology Department; Key Science and Technology Program of Shaanxi Province; National Social Science Fund of China; Key Research and Development Program of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; Georgia Southern University","keywords":"Mathematics; Scheme (mathematics); Polynomial-time approximation scheme; Time complexity; Polynomial; Combinatorics","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":[],"consensus_categories":[],"category_scores_codex":[0.000290883,0.0002181373,0.0002980705,0.0001020282,0.0001314075,0.0002214098,0.0004465796,0.000117407,0.00004565865],"category_scores_gemma":[0.00003348388,0.0002125519,0.0000579241,0.0002117059,0.00002905558,0.00008534854,0.00007260552,0.00009787236,0.0000502546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005549887,"about_ca_system_score_gemma":0.00002883895,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001709559,"about_ca_topic_score_gemma":0.000001044554,"domain_scores_codex":[0.9989839,0.000006600631,0.0003821319,0.000243914,0.0001216225,0.0002618195],"domain_scores_gemma":[0.9992827,0.00007791985,0.00006886917,0.0004453567,0.00004636253,0.00007881134],"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.00002517592,0.0002006017,0.000002178241,0.0004789893,0.00008332873,3.148967e-7,0.001071888,0.9474012,0.008742313,0.03992484,0.0005812079,0.001487989],"study_design_scores_gemma":[0.001139358,0.00001062695,0.000006375597,0.00004070998,0.00003169015,2.948994e-7,0.0006133157,0.992907,0.004278075,0.0004113712,0.000315408,0.0002457502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006230851,0.00002870495,0.9819026,0.00003961688,0.0001096013,0.001429776,0.00005053772,0.0004220767,0.009786258],"genre_scores_gemma":[0.02110692,0.000004314444,0.9771755,0.00006151968,0.00003594231,0.000476489,0.0002063126,0.00005926715,0.0008737759],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04550585,"threshold_uncertainty_score":0.8667613,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02640066741995729,"score_gpt":0.2988661237485875,"score_spread":0.2724654563286302,"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."}}