{"id":"W3192155567","doi":"10.1287/ijoo.2021.0056","title":"Critical-Path-Search Logic-Based Benders Decomposition Approaches for Flexible Job Shop Scheduling","year":2021,"lang":"en","type":"article","venue":"INFORMS Journal on Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; University of Regina","funders":"","keywords":"Job shop scheduling; GRASP; Mathematical optimization; Integer programming; Computer science; Scheduling (production processes); Greedy algorithm; Local optimum; Constraint programming; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001238895,0.001123677,0.0006631624,0.001205982,0.0005124942,0.0008432163,0.001059379,0.0007414168,0.004152225],"category_scores_gemma":[0.001716166,0.0005974811,0.001407187,0.001086713,0.0006028512,0.001017716,0.0007029133,0.0013203,0.000361548],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001181704,"about_ca_system_score_gemma":0.002396703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004019663,"about_ca_topic_score_gemma":0.006801941,"domain_scores_codex":[0.9994765,0.0001930142,0.0000224878,0.00008096384,0.0001442985,0.00008276678],"domain_scores_gemma":[0.9994301,0.0003415266,0.00009133499,0.00004226956,0.00005937418,0.00003539475],"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.0000376866,0.00006084767,0.0002667073,0.00007718584,0.00003310433,0.00003215682,0.00002297303,0.9634817,0.001485365,0.01036658,0.0005988798,0.02353686],"study_design_scores_gemma":[0.00001132228,0.00004102403,0.0000505433,0.000008426221,0.000007416122,0.00001259141,0.00001075127,0.9921907,0.0004973051,0.006669197,0.0004962348,0.00000447629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03554398,0.000383623,0.956647,0.0002992855,0.00004250758,0.000117883,0.0001670063,0.0003357109,0.006462969],"genre_scores_gemma":[0.3976005,0.0005683374,0.5976174,0.0002085885,0.0000493145,0.0002319621,0.0004365235,0.0001440324,0.00314335],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004152225,"threshold_uncertainty_score":0.01389062,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0573044278968977,"score_gpt":0.3053361166479256,"score_spread":0.2480316887510279,"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."}}