{"id":"W2109592237","doi":"10.5267/j.uscm.2014.4.003","title":"A rolling horizon-based heuristic to solve a multi-level general lot sizing and scheduling problem with multiple machines (MLGLSP_MM) in job shop manufacturing system","year":2014,"lang":"en","type":"article","venue":"Uncertain Supply Chain Management","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Kharazmi University","keywords":"Sizing; Mathematical optimization; Job shop scheduling; Time horizon; Scheduling (production processes); Computer science; Integer programming; Heuristic; Flow shop scheduling; Job shop; Operations research; Mathematics; Schedule","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.0008477059,0.0006675609,0.00105129,0.0005209466,0.0004855537,0.0006599388,0.0009669008,0.0007341281,0.002017418],"category_scores_gemma":[0.0008427227,0.0004830378,0.000630217,0.0006929388,0.0003683436,0.0007332867,0.000542484,0.0005898024,0.0001431351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008924973,"about_ca_system_score_gemma":0.001600259,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008328852,"about_ca_topic_score_gemma":0.007659972,"domain_scores_codex":[0.9995964,0.0001471597,0.00001715413,0.00006877853,0.00008394549,0.0000866335],"domain_scores_gemma":[0.9996506,0.0002012968,0.00005029272,0.00002119284,0.00003331124,0.00004326887],"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.0000841287,0.00004357661,0.0001516302,0.00007249132,0.00002199714,0.00004146585,0.00002424742,0.9716198,0.001418173,0.002231052,0.0004649718,0.02382649],"study_design_scores_gemma":[0.00001050778,0.00004211704,0.0000534035,0.00000217416,0.000005454429,0.000005631625,0.000005190273,0.9990182,0.0002501704,0.0004317365,0.0001722072,0.000003145983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07960505,0.0007337457,0.9142249,0.0002017495,0.00007370338,0.0001675313,0.0001391659,0.0006654962,0.004188643],"genre_scores_gemma":[0.7132835,0.0002504535,0.2845283,0.00007099079,0.00002246653,0.0001843647,0.0001754213,0.0000516238,0.001432734],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008328852,"threshold_uncertainty_score":0.01656073,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01378659438417564,"score_gpt":0.2171626678387241,"score_spread":0.2033760734545485,"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."}}