{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002125181,0.0006930858,0.0014774,0.0008018967,0.0005964871,0.001571171,0.002337096,0.002091018,0.002520957],"category_scores_gemma":[0.004809111,0.0009299491,0.001315565,0.001044794,0.001729902,0.00265741,0.0008741399,0.001410962,0.0001870706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00180335,"about_ca_system_score_gemma":0.00190484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006689818,"about_ca_topic_score_gemma":0.006482515,"domain_scores_codex":[0.9994395,0.0002754613,0.00002002061,0.0001004677,0.00009415711,0.00007041107],"domain_scores_gemma":[0.9976884,0.001832246,0.0001961334,0.00006481823,0.0001173749,0.0001010533],"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.00004911682,0.00003854635,0.0001680052,0.00005015148,0.00002062608,0.00003386555,0.00002193103,0.9608579,0.0002917313,0.03367369,0.0004077798,0.004386628],"study_design_scores_gemma":[0.00001138143,0.00001182731,0.00005062532,0.0000034047,0.000004393974,0.000005576946,0.000004186878,0.9923497,0.00005753733,0.007372093,0.0001256762,0.000003742067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07989185,0.0007659793,0.9127658,0.0009200101,0.00007975387,0.0001180855,0.0001738909,0.00009296859,0.005191686],"genre_scores_gemma":[0.8513718,0.0008681535,0.1365606,0.0001417833,0.00009319978,0.0002305261,0.0001739847,0.00005331376,0.01050656],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006689818,"threshold_uncertainty_score":0.01330173,"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."}}