{"id":"W4405121936","doi":"10.5267/j.ijiec.2024.11.003","title":"You are entitled to access the full text of this documentA novel hybrid algorithm of cooperative variable neighborhood search and constraint programming for flexible job shop scheduling problem with sequence dependent setup time","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Science Foundation of Shandong Province; Liaocheng University; National Natural Science Foundation of China","keywords":"Variable neighborhood search; Job shop scheduling; Mathematical optimization; Scheduling (production processes); Algorithm; Constraint (computer-aided design); Sequence (biology); Heuristic; Computer science; Hybrid algorithm (constraint satisfaction); Variable (mathematics); Constraint programming; Mathematics; Constraint logic programming; Metaheuristic; Schedule; Stochastic programming","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.0004531842,0.000147071,0.0002285419,0.0003340135,0.00004633956,0.0002806187,0.0003061645,0.00005374386,0.0000426473],"category_scores_gemma":[0.0001287954,0.0001172356,0.00005633296,0.0003577905,0.00004278548,0.0003119848,0.00005596676,0.0003097722,0.000001061258],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001282585,"about_ca_system_score_gemma":0.0002457865,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001579491,"about_ca_topic_score_gemma":9.759249e-7,"domain_scores_codex":[0.9987829,0.00001527406,0.0005190143,0.0001345136,0.0003872307,0.0001611014],"domain_scores_gemma":[0.9986772,0.0003038081,0.0001080223,0.00006842548,0.0007540791,0.00008848402],"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.00003190247,0.00003046519,0.00002287904,0.00004302878,0.0004941045,0.000006814758,0.0003540718,0.9864486,0.002213967,0.0008695019,0.00004255497,0.009442099],"study_design_scores_gemma":[0.0009133003,0.000150049,0.000004966322,0.000880052,0.0000630793,0.00017092,0.0002112423,0.9908121,0.006507499,0.00003195958,0.0001321267,0.000122725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01810997,0.0001413699,0.9799991,0.0004171614,0.0005932408,0.0004002197,0.0002423126,0.00006002307,0.0000366565],"genre_scores_gemma":[0.5358713,0.00001575503,0.4636089,0.00001191529,0.0003456465,0.00002675541,0.00003711396,0.0000382368,0.00004445197],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5177613,"threshold_uncertainty_score":0.4780728,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03172744612313183,"score_gpt":0.2925761604895104,"score_spread":0.2608487143663786,"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."}}