{"id":"W4393121421","doi":"10.5267/j.ijiec.2023.12.007","title":"An improved iterated greedy algorithm for distributed mixed no-wait permutation flowshop problems with makespan criterion","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Liaocheng University; National Natural Science Foundation of China; Natural Science Foundation of Shandong Province; Strong","keywords":"Greedy algorithm; Permutation (music); Iterated function; Job shop scheduling; Mathematical optimization; Algorithm; Mathematics; Computer science; Routing (electronic design automation)","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.0002625303,0.0002264783,0.0002245605,0.0005245422,0.00005508027,0.00052062,0.0002635717,0.000141411,0.00002476722],"category_scores_gemma":[0.0001156486,0.0002112419,0.0001104934,0.0004007528,0.00001908896,0.0006310276,0.00001070522,0.0003815957,0.000005632437],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002263898,"about_ca_system_score_gemma":0.0001305983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005799869,"about_ca_topic_score_gemma":0.000001780141,"domain_scores_codex":[0.9986376,0.00002261637,0.0006172748,0.0001811369,0.0003395456,0.0002018766],"domain_scores_gemma":[0.9983435,0.0001735951,0.0001031351,0.00009102561,0.001145617,0.0001431136],"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.00003030585,0.00004188681,0.000007689787,0.00002317346,0.0003367302,0.00002411262,0.0002224438,0.9562583,0.00159958,0.00006213792,0.0002448063,0.04114881],"study_design_scores_gemma":[0.001422137,0.0002913188,0.00004571928,0.0003961669,0.00006746091,0.0001693642,0.00006439519,0.994998,0.0005914634,0.00003103205,0.001685412,0.0002375169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02050454,0.0001185883,0.9724118,0.0002110523,0.005801045,0.0002591165,0.0003155152,0.0003678772,0.0000104423],"genre_scores_gemma":[0.680319,0.00002068381,0.3152599,0.0000224331,0.00298276,0.00004869615,0.001200292,0.000117246,0.0000290467],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6598144,"threshold_uncertainty_score":0.8614193,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01682667139531591,"score_gpt":0.252478147932832,"score_spread":0.2356514765375161,"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."}}