{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009279264,0.00009819502,0.0001092247,0.00003064516,0.0006712361,0.0003221294,0.001396988,0.00004152603,0.00001103677],"category_scores_gemma":[0.0002336355,0.00005789607,0.00005901168,0.0001186196,0.001671894,0.0002425508,0.0001561867,0.0001151577,0.000003482987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001664711,"about_ca_system_score_gemma":0.00002315324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.746364e-7,"about_ca_topic_score_gemma":6.472047e-7,"domain_scores_codex":[0.9990591,0.00003160371,0.0001991481,0.0001966397,0.0002758523,0.0002376814],"domain_scores_gemma":[0.9988763,0.0001115841,0.0000567439,0.0007700773,0.000109138,0.00007618875],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001284742,0.00005599434,0.0002524936,0.00004048253,0.000009960806,3.956664e-7,0.001016804,0.2728683,0.001507585,0.7138062,0.000009126146,0.01041986],"study_design_scores_gemma":[0.0002497941,0.0000197213,0.00195754,0.00002092334,0.000006271149,0.000001696919,0.00003609043,0.9911754,0.003483103,0.002955775,0.000008594,0.00008515966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05882234,0.000007928538,0.9398974,0.0003217059,0.0004868598,0.0002136271,0.000004176605,0.00006699106,0.0001790268],"genre_scores_gemma":[0.5353853,8.031075e-7,0.4644972,0.00003972093,0.00005767367,0.000007198312,6.204644e-7,0.000006452907,0.000005077395],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7183071,"threshold_uncertainty_score":0.6160165,"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."}}