{"id":"W2795993153","doi":"10.1007/978-3-319-89656-4_5","title":"Logic-Based Benders Decomposition for Two-Stage Flexible Flow Shop Scheduling with Unrelated Parallel Machines","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Job shop scheduling; Computer science; Mathematical optimization; Integer programming; Benders' decomposition; Flow shop scheduling; Decomposition; Scheduling (production processes); Schedule; Minification; Parallel computing; Algorithm; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003295855,0.0004680751,0.0003718832,0.0005103993,0.000228298,0.0002314541,0.0005161138,0.0002806208,0.00008140743],"category_scores_gemma":[0.00003085154,0.0004073237,0.00009108573,0.0003356837,0.0003138226,0.0001775554,0.00005696413,0.000457188,0.00001505672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001898196,"about_ca_system_score_gemma":0.000153607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004589865,"about_ca_topic_score_gemma":0.00003989031,"domain_scores_codex":[0.9981069,0.00001142425,0.0003368288,0.0006973377,0.0003840855,0.0004634114],"domain_scores_gemma":[0.9988689,0.000252574,0.0001048679,0.000421099,0.0002303318,0.0001222461],"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.00002993003,0.000009409403,0.0000111969,0.00005963624,0.00002172772,0.000007989755,0.0001248962,0.9788852,0.00004516279,0.0003069613,0.000004739732,0.02049318],"study_design_scores_gemma":[0.000862217,0.000157399,0.000003274462,0.0003621464,0.00002256159,0.00001023809,4.769616e-7,0.9921969,0.001132815,0.004652118,0.00006302816,0.0005368693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001839814,0.0002612748,0.9968334,0.0001331179,0.000950012,0.0004479025,0.00002159567,0.0005110492,0.0006577006],"genre_scores_gemma":[0.01794705,0.00000973276,0.9809141,0.0004222745,0.0003631872,0.00001910475,0.0001137511,0.00008175079,0.0001290544],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01995631,"threshold_uncertainty_score":0.9998379,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01869293230081087,"score_gpt":0.2630693514547308,"score_spread":0.2443764191539199,"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."}}