{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004150601,0.0006759887,0.0006736446,0.0004427122,0.0003951291,0.0004444926,0.001205926,0.000744353,0.0008273571],"category_scores_gemma":[0.0009717339,0.0002907814,0.0004688283,0.0004217825,0.0003269643,0.0006554046,0.0005198722,0.0006593739,0.0001235118],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003725485,"about_ca_system_score_gemma":0.001009713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004556745,"about_ca_topic_score_gemma":0.004318006,"domain_scores_codex":[0.9997656,0.00005837572,0.00001366402,0.00004403394,0.00008956243,0.00002877249],"domain_scores_gemma":[0.9997068,0.0001420363,0.0000375524,0.00002346764,0.00006727874,0.00002277556],"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.00006239624,0.00008127874,0.0006938313,0.00009084142,0.00005641752,0.00008199954,0.00006000268,0.9065036,0.004526852,0.005433812,0.001244338,0.08116469],"study_design_scores_gemma":[0.00001365933,0.00002834133,0.00006014613,0.000002381002,0.000005705645,0.00001533499,0.000005204208,0.9985394,0.0002794958,0.0007115952,0.0003355069,0.000003228003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03805092,0.0004528098,0.9582314,0.0001682834,0.00005209455,0.00007833978,0.00002173775,0.0003101778,0.002634257],"genre_scores_gemma":[0.6473925,0.0003433856,0.3487932,0.0001546204,0.00004286754,0.0003145452,0.00009738876,0.00005621612,0.002805322],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004556745,"threshold_uncertainty_score":0.009060442,"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."}}