{"id":"W2805549752","doi":"10.1007/s10878-018-0314-6","title":"A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Theory of computation; Computer science; Job shop scheduling; Time complexity; Scheduling (production processes); Mathematical optimization; Polynomial-time approximation scheme; Dynamic programming; Approximation algorithm; Schedule; sort; Algorithm; Parallel computing; 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.001516398,0.0009625687,0.001715288,0.0005748799,0.001256486,0.001702635,0.003227022,0.001128384,0.006000753],"category_scores_gemma":[0.004235123,0.0006149691,0.000892801,0.001406038,0.0008053707,0.002055167,0.002140026,0.001486637,0.0006908255],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002147354,"about_ca_system_score_gemma":0.003126706,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00730254,"about_ca_topic_score_gemma":0.01138826,"domain_scores_codex":[0.9988137,0.0002378825,0.00005768596,0.0002157546,0.0003133842,0.0003616792],"domain_scores_gemma":[0.9982775,0.0007731261,0.0001290025,0.0004594156,0.0002228842,0.0001380554],"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.0005779322,0.000202332,0.0003848983,0.0001844622,0.00004366523,0.0001014776,0.0001380877,0.887933,0.005477401,0.02973949,0.00442061,0.07079662],"study_design_scores_gemma":[0.00002474309,0.0000445294,0.00004936435,0.00000476632,0.000008412239,0.00001558778,0.00001696185,0.9910705,0.0005381716,0.007764444,0.0004569686,0.000005454324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06946066,0.0002257036,0.9214944,0.0002795975,0.0001161738,0.0001958898,0.0002466629,0.001223704,0.006757235],"genre_scores_gemma":[0.6451721,0.0001689435,0.3482453,0.0001240537,0.00006057409,0.0002122575,0.0003909136,0.00018722,0.005438598],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00730254,"threshold_uncertainty_score":0.02007455,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01361254791640527,"score_gpt":0.2620959733299292,"score_spread":0.2484834254135239,"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."}}