{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002977618,0.0001076118,0.0001133693,0.0001827419,0.0001434923,0.0001123631,0.0001496835,0.00003100378,0.000007085856],"category_scores_gemma":[0.00006407436,0.00009349937,0.00003122555,0.0001378677,0.00001998847,0.000116792,0.00003660429,0.0002915197,1.308653e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001296546,"about_ca_system_score_gemma":0.0000604961,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009128302,"about_ca_topic_score_gemma":5.409061e-7,"domain_scores_codex":[0.9992501,0.00001544807,0.0002512255,0.00009472667,0.0002682708,0.0001202927],"domain_scores_gemma":[0.9994346,0.0002168727,0.000103174,0.00004297178,0.0001503654,0.00005195128],"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.00002985761,0.00001292001,0.00006066925,0.00001275334,0.0001153583,0.000003499859,0.0001887257,0.9961014,0.0002091775,0.0001632922,0.0000114571,0.003090862],"study_design_scores_gemma":[0.001211817,0.00007074007,0.00002617959,0.00004686247,0.00003602158,0.0001908838,0.0002030358,0.997857,0.00006964563,0.00001364669,0.0001695124,0.0001046353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03261402,0.0002530632,0.9659929,0.0003272861,0.0005502855,0.0001856364,0.00002446418,0.00003962946,0.00001269276],"genre_scores_gemma":[0.6537202,0.00001710542,0.3458719,0.0000246306,0.0002957301,0.00002731569,0.00001486057,0.0000224086,0.000005857564],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6211062,"threshold_uncertainty_score":0.3812794,"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."}}