{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004403276,0.0004685978,0.0004101977,0.0004810804,0.000180206,0.0001410854,0.0002225365,0.00008864795,0.000003464536],"category_scores_gemma":[0.00004239833,0.0004431195,0.00004467969,0.0002146475,0.00003501763,0.0001106059,0.0001037077,0.0002500396,0.000005731199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003351685,"about_ca_system_score_gemma":0.0000100453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002151543,"about_ca_topic_score_gemma":0.0004231565,"domain_scores_codex":[0.997937,0.00004917271,0.00045619,0.000611886,0.0002843434,0.0006613981],"domain_scores_gemma":[0.9991786,0.0001749041,0.00007742127,0.0003600433,0.00003568171,0.0001733332],"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.00006421559,0.00002952183,0.001542308,0.001220947,0.00005094523,0.00004738427,0.000281851,0.9845237,0.0001121329,0.000719813,0.000006795551,0.01140046],"study_design_scores_gemma":[0.001988113,0.0001031258,0.001736559,0.0006729913,0.00004153136,0.0000038946,0.0004110878,0.9932138,0.0009977521,0.00008303262,0.0001794957,0.0005686554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1062744,0.0001104092,0.8916566,0.00007279816,0.0001332176,0.001007562,0.0000150992,0.0004527631,0.0002771223],"genre_scores_gemma":[0.5931034,0.00001416186,0.4064408,0.00004128728,0.0000642025,0.0001758121,0.00003192989,0.00006945497,0.00005895588],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.486829,"threshold_uncertainty_score":0.9998021,"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."}}