{"id":"W2409994095","doi":"10.1016/j.tcs.2016.04.046","title":"An FPTAS for the parallel two-stage flowshop problem","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Alberta Innovates - Technology Futures; Program for Changjiang Scholars and Innovative Research Team in University; Georgia Southern University","keywords":"Job shop scheduling; Schedule; Subroutine; Computer science; Mathematical optimization; Scheme (mathematics); Dynamic programming; Time complexity; Scheduling (production processes); Polynomial-time approximation scheme; Parallel computing; Algorithm; Mathematics","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.001094406,0.00132919,0.001640054,0.0005940404,0.0006681157,0.001629189,0.002183455,0.002491815,0.006700086],"category_scores_gemma":[0.003307389,0.0007335379,0.001040152,0.001134894,0.0007863067,0.001933862,0.001678115,0.002833475,0.0004660235],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001923878,"about_ca_system_score_gemma":0.003029336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009737051,"about_ca_topic_score_gemma":0.009184299,"domain_scores_codex":[0.9994631,0.0001217626,0.00001799254,0.0001292261,0.000122483,0.0001454673],"domain_scores_gemma":[0.9989172,0.0007894909,0.0000562729,0.00007115624,0.00008696563,0.00007892436],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002273141,0.0002116661,0.0003207712,0.0002587997,0.00005717305,0.0001531335,0.0000701178,0.8934399,0.0009997709,0.04324216,0.009320615,0.05169851],"study_design_scores_gemma":[0.00007514998,0.00005325751,0.00008056506,0.00002020192,0.00002196171,0.00004593033,0.00002518902,0.9705296,0.0001980382,0.02709785,0.001844895,0.000007494132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04686914,0.001196967,0.9175806,0.002231486,0.0003461298,0.0003128227,0.0007926742,0.0007167066,0.02995344],"genre_scores_gemma":[0.5129418,0.001517888,0.4658834,0.0006144808,0.0003263596,0.0006820977,0.0009257236,0.0002194904,0.01688881],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009737051,"threshold_uncertainty_score":0.02241409,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01124981111899529,"score_gpt":0.2538741781736025,"score_spread":0.2426243670546072,"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."}}