{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007143393,0.0002132367,0.0003503677,0.0002848067,0.0001575046,0.0001984136,0.0002363437,0.000168708,0.0001299295],"category_scores_gemma":[0.0005175497,0.0002126168,0.0001551455,0.0003034032,0.0000521362,0.0005020544,0.00002173359,0.0002411965,0.00003721841],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001585334,"about_ca_system_score_gemma":0.00009076598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.100104e-7,"about_ca_topic_score_gemma":7.938159e-8,"domain_scores_codex":[0.9983212,0.0000556267,0.0007957229,0.0001603391,0.0004053495,0.000261723],"domain_scores_gemma":[0.9984485,0.0001362428,0.0003342555,0.0001674819,0.0007609421,0.0001525664],"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.0004016071,0.00008762372,0.00001537817,0.00002136258,0.00006851366,0.000001894617,0.0001148384,0.9947385,0.0005301442,0.003134353,0.0005686224,0.000317126],"study_design_scores_gemma":[0.004571142,0.0004918219,0.000008237909,0.00007769468,0.00004734959,0.00001219645,0.00003523455,0.9916114,0.002079709,0.0004177578,0.0004240921,0.000223356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01992805,0.00004325074,0.9731244,0.0001655874,0.005358213,0.0003477444,0.000007067957,0.0001222858,0.0009033967],"genre_scores_gemma":[0.1164737,0.00001992963,0.8799881,0.00006799663,0.003211988,0.00001249735,0.00003485661,0.00007271943,0.0001182151],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.09654561,"threshold_uncertainty_score":0.867026,"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."}}