{"id":"W4399681246","doi":"10.5267/j.ijiec.2024.3.001","title":"A novel hybrid algorithm of genetic algorithm, variable neighborhood search and constraint programming for distributed flexible job shop scheduling problem","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Science Foundation of Shandong Province; Liaocheng University; National Natural Science Foundation of China","keywords":"Algorithm; Variable neighborhood search; Computer science; Job shop scheduling; Hybrid algorithm (constraint satisfaction); Constraint programming; Mathematical optimization; Scheduling (production processes); Variable (mathematics); Constraint logic programming; Metaheuristic; Mathematics; Stochastic programming; Schedule","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004043739,0.0001973511,0.0002850097,0.0005232946,0.00004426414,0.0002608214,0.000241033,0.0001095963,0.00001090523],"category_scores_gemma":[0.0001635173,0.0002071269,0.0001213156,0.000392281,0.00004452935,0.0002369775,0.00003946347,0.0004385185,7.569777e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001469029,"about_ca_system_score_gemma":0.0002567807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009919423,"about_ca_topic_score_gemma":1.209844e-7,"domain_scores_codex":[0.998397,0.00001282261,0.000793059,0.0001675017,0.00039026,0.000239346],"domain_scores_gemma":[0.9986457,0.0003556281,0.00009090742,0.00007009541,0.0006965259,0.000141147],"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.000006810837,0.00003470614,0.00001648813,0.00004981774,0.0004343356,0.00001342668,0.0001227747,0.8301135,0.0004180362,0.0008020658,0.0000252115,0.1679628],"study_design_scores_gemma":[0.00128891,0.00009856992,0.00002018845,0.0006148718,0.00007602239,0.0004175394,0.0001241895,0.9957065,0.0009078912,0.0001793885,0.0003816057,0.0001843004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003086109,0.0006303648,0.9931717,0.0001812944,0.002085167,0.0002697838,0.0003887312,0.0001735205,0.00001333301],"genre_scores_gemma":[0.1229956,0.00003696196,0.8759441,0.000004909694,0.000870833,0.00001689035,0.00007759265,0.00004696868,0.000006117242],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1677785,"threshold_uncertainty_score":0.8446389,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02386977824688337,"score_gpt":0.265703349061134,"score_spread":0.2418335708142506,"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."}}