{"id":"W4408378018","doi":"10.5267/j.ijiec.2025.2.003","title":"A hybrid artificial bee colony algorithm with an iterated local search mechanism for distributed no-wait flowshop problems with preventive maintenance","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Artificial bee colony algorithm; Mechanism (biology); Iterated function; Iterated local search; Preventive maintenance; Computer science; Mathematical optimization; Local search (optimization); Algorithm; Artificial intelligence; Engineering; Mathematics; Reliability engineering","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.0002539221,0.0002094702,0.0002638231,0.0004078345,0.00007596825,0.0001937763,0.0003097506,0.00009398675,0.00001094267],"category_scores_gemma":[0.0001252856,0.00018526,0.0000748415,0.0003589547,0.00003964247,0.0002990357,0.0000205287,0.0004289522,0.000002070052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002783693,"about_ca_system_score_gemma":0.0002646625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009968187,"about_ca_topic_score_gemma":0.000004461132,"domain_scores_codex":[0.9986267,0.00002788031,0.0005399262,0.000176715,0.0003872563,0.0002415245],"domain_scores_gemma":[0.9973664,0.0001741459,0.0001222953,0.00008091817,0.002137799,0.000118436],"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.0002007804,0.00009219836,0.000006686496,0.00001319854,0.0005260156,0.00003316835,0.00008807694,0.9885371,0.0001846663,0.001645651,0.0002230004,0.008449401],"study_design_scores_gemma":[0.002419413,0.0004310227,0.00001659313,0.0005133034,0.00006471983,0.00009894825,0.00009490058,0.993257,0.002311783,0.0003242788,0.0002705494,0.0001974692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02212079,0.00001463587,0.9754355,0.0003461754,0.001316286,0.0003625461,0.0002563412,0.0001300921,0.00001761304],"genre_scores_gemma":[0.7021091,0.000007906539,0.296478,0.0000473333,0.0008683261,0.00005784863,0.0003151503,0.00005810193,0.00005821397],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6799883,"threshold_uncertainty_score":0.7554684,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01570825478179901,"score_gpt":0.2490342216515126,"score_spread":0.2333259668697136,"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."}}