{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007029287,0.00009601915,0.00007919643,0.00003986736,0.0002112182,0.0001309809,0.0006518275,0.00002368431,0.0000749654],"category_scores_gemma":[0.00003119133,0.00004849831,0.00003138539,0.0002261889,0.0008639434,0.0001878741,0.00005270202,0.00005539184,0.00003211332],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002290567,"about_ca_system_score_gemma":0.0000220182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.764973e-7,"about_ca_topic_score_gemma":3.579322e-7,"domain_scores_codex":[0.9991219,0.000017787,0.0001244288,0.0002280653,0.0002003961,0.0003074151],"domain_scores_gemma":[0.9991589,0.0002624508,0.00001154098,0.0003639702,0.00007634218,0.0001268106],"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.000005337064,0.00001028567,0.000006434241,0.000003866882,0.00000342113,4.729332e-7,0.0001183954,0.2412151,0.0004926996,0.7065089,0.00002836487,0.05160673],"study_design_scores_gemma":[0.0002761097,0.00005528377,0.00003747366,0.00001112002,0.000003760719,0.000002642271,0.000006423802,0.9838573,0.001320178,0.01411171,0.0002103278,0.0001076733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004030716,0.00002035861,0.9938796,0.000561999,0.0003889911,0.0001782346,0.000004981559,0.0002757066,0.0006594635],"genre_scores_gemma":[0.5754861,0.000004370943,0.4242194,0.0001095447,0.0001368365,0.00001627393,4.360661e-7,0.000009456218,0.00001760305],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7426422,"threshold_uncertainty_score":0.3183236,"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."}}