{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004322036,0.0002181758,0.0002189988,0.0002873656,0.0003709724,0.0004964799,0.0001443368,0.0001902215,0.0001707827],"category_scores_gemma":[0.0003683163,0.0002078887,0.0001535822,0.0004146304,0.00004005229,0.0006467593,0.00001491183,0.0003964241,0.00001404786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001980469,"about_ca_system_score_gemma":0.0001529091,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.531138e-7,"about_ca_topic_score_gemma":2.820902e-7,"domain_scores_codex":[0.9985123,0.00003201926,0.0005072357,0.0001885534,0.0003686482,0.000391186],"domain_scores_gemma":[0.9987675,0.0002178407,0.00006547067,0.0001798842,0.0005617764,0.0002075172],"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.00004542724,0.00004987476,0.00003267269,0.00007200646,0.00003569458,0.000007297658,0.00009621851,0.9919684,0.00004544197,0.003023839,0.00007649815,0.004546657],"study_design_scores_gemma":[0.0009801158,0.0001133743,0.000015974,0.0001201944,0.00002792224,0.00005655091,0.0004156812,0.9927034,0.004825908,0.0003851358,0.00009160549,0.0002641794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001577211,0.0002305387,0.9937311,0.0006901015,0.0007014117,0.0001730603,0.00001551989,0.0003033631,0.002577696],"genre_scores_gemma":[0.1017974,0.0001586691,0.8968913,0.0004693985,0.000302762,0.00002894536,0.000216435,0.00006133678,0.00007378162],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1002202,"threshold_uncertainty_score":0.8477454,"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."}}