{"id":"W2938732013","doi":"10.1016/j.asoc.2019.03.054","title":"The economic lot scheduling problem in limited-buffer flexible flow shops: Mathematical models and a discrete fruit fly algorithm","year":2019,"lang":"en","type":"article","venue":"Applied Soft Computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Tabu search; Mathematical optimization; Computer science; Scheduling (production processes); Job shop scheduling; Flow shop scheduling; Genetic algorithm; Integer programming; Linear programming; Algorithm; Mathematics; Schedule","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005325284,0.0002529105,0.0003091207,0.00009622651,0.0001624614,0.0002307019,0.0002207231,0.0001378031,0.00001563555],"category_scores_gemma":[0.00001169395,0.0002183658,0.00004750141,0.0001626158,0.00004508254,0.0001223016,0.0001289243,0.0003990281,0.0001240773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001100983,"about_ca_system_score_gemma":0.00003433497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000517227,"about_ca_topic_score_gemma":0.000002104479,"domain_scores_codex":[0.9985564,0.000020166,0.0004578244,0.0003518549,0.0001447839,0.0004689812],"domain_scores_gemma":[0.9991323,0.0004166194,0.00005589316,0.0002806659,0.00001979344,0.00009470446],"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.000004664725,0.000006681441,0.00004024268,0.00005230964,0.00002881577,8.160953e-7,0.0008147184,0.949901,0.00003665034,0.004795242,0.000008177517,0.0443107],"study_design_scores_gemma":[0.0005540717,0.00001074905,0.00002184853,0.00009035178,0.000009850869,0.000007417317,0.0004724731,0.9914655,0.0001297656,0.006921302,0.00003824812,0.000278421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08272331,0.0003298443,0.9120814,0.00006721118,0.0002008018,0.0004928996,0.000003502312,0.0004921657,0.003608861],"genre_scores_gemma":[0.4772335,0.00002836935,0.5224652,0.00005017891,0.00009152891,0.00002089444,0.000008466736,0.00005964356,0.00004223381],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3945102,"threshold_uncertainty_score":0.89047,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01007715843321026,"score_gpt":0.2170151586725836,"score_spread":0.2069380002393734,"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."}}