{"id":"W4309716977","doi":"10.5267/j.ijiec.2022.9.003","title":"A matheuristic based solution approach for the general lot sizing and scheduling problem with sequence dependent changeovers and back ordering","year":2022,"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":"","keywords":"Mathematical optimization; Sizing; Simulated annealing; Scheduling (production processes); Integer programming; Sequence (biology); Variable neighborhood search; Computer science; Mathematics; Metaheuristic","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.0007495468,0.001078562,0.0006796265,0.001016089,0.0004883507,0.001010448,0.00137893,0.001117805,0.003850241],"category_scores_gemma":[0.001529473,0.0005057607,0.001079797,0.0007112534,0.0006776455,0.0006602659,0.0009395236,0.001196976,0.0004877009],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001087567,"about_ca_system_score_gemma":0.001963012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00453363,"about_ca_topic_score_gemma":0.005251386,"domain_scores_codex":[0.999635,0.00009707994,0.00001646621,0.00005615802,0.0001609595,0.00003434495],"domain_scores_gemma":[0.9995497,0.000249601,0.00006138409,0.00002785551,0.00008871418,0.00002270692],"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.00002144191,0.00003159735,0.0001674079,0.00008711994,0.00002361306,0.00004653927,0.00003139142,0.9666089,0.001512484,0.01074652,0.0004824002,0.02024047],"study_design_scores_gemma":[0.000007120818,0.00002547491,0.00003833531,0.000006924935,0.000004846866,0.00002299275,0.000006480976,0.9959311,0.0003111247,0.00279843,0.0008435373,0.000003684791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004360045,0.00009557298,0.9907843,0.0001061809,0.000029792,0.00005536338,0.00003196178,0.0001195194,0.004417219],"genre_scores_gemma":[0.1936703,0.0003335944,0.800965,0.0002103189,0.00006780892,0.0003520846,0.0001531361,0.0000844704,0.004163334],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00453363,"threshold_uncertainty_score":0.01288038,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04079696738706833,"score_gpt":0.2478680294642839,"score_spread":0.2070710620772156,"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."}}