{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001422178,0.0006992841,0.001562665,0.0004642369,0.0009149213,0.001236722,0.002640328,0.0009932611,0.004143927],"category_scores_gemma":[0.003124623,0.0006111911,0.001084742,0.0009997883,0.0006757073,0.001590016,0.001737044,0.001671367,0.0006194799],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001395291,"about_ca_system_score_gemma":0.002575763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005607367,"about_ca_topic_score_gemma":0.006803822,"domain_scores_codex":[0.9991745,0.0001835593,0.0000447966,0.0001586818,0.0002406586,0.0001978662],"domain_scores_gemma":[0.9986585,0.0006680788,0.00009814406,0.0002830486,0.0001762976,0.0001158753],"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.0004830667,0.0001822587,0.0003571074,0.0001513637,0.00003571297,0.00007693841,0.0001134252,0.8634685,0.005143786,0.03564784,0.002840054,0.09149995],"study_design_scores_gemma":[0.00002832982,0.00003669177,0.00003723456,0.000003791421,0.000006163481,0.00001098555,0.000009457275,0.9889129,0.0005648393,0.009834278,0.000551211,0.000004139197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0266315,0.0001210668,0.9696826,0.0001219225,0.00005982534,0.00009290796,0.0001303465,0.0006635924,0.002496201],"genre_scores_gemma":[0.4466147,0.0001504821,0.5484366,0.00007148188,0.00004886257,0.0002054951,0.0003786281,0.0001748728,0.003918801],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005607367,"threshold_uncertainty_score":0.01386279,"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."}}