{"id":"W2065024613","doi":"10.1287/mnsc.47.6.851.9813","title":"A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover","year":2001,"lang":"en","type":"article","venue":"Management Science","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":103,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tabu search; Heuristic; Sizing; Mathematical optimization; Set (abstract data type); Incremental heuristic search; Bounding overwatch; Computer science; Null-move heuristic; Beam search; Mathematics; Search algorithm; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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.001050102,0.0008526256,0.000899947,0.001313484,0.0008784203,0.0009730565,0.001623157,0.001080708,0.005470206],"category_scores_gemma":[0.003028607,0.000624584,0.0007683039,0.001882793,0.0007790813,0.001100967,0.000502701,0.0009075021,0.0007029893],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001524674,"about_ca_system_score_gemma":0.002233165,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00959486,"about_ca_topic_score_gemma":0.0105824,"domain_scores_codex":[0.9994429,0.0002563103,0.00002047326,0.00005866127,0.0001267689,0.00009493664],"domain_scores_gemma":[0.9990514,0.0006175492,0.00007861636,0.00007166625,0.0001337854,0.00004702695],"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.000106241,0.00011514,0.0003840813,0.0001107617,0.00004492676,0.00006615859,0.00007868667,0.9072308,0.001226123,0.009089827,0.00325374,0.0782936],"study_design_scores_gemma":[0.00005833802,0.0000872657,0.0001513891,0.0000201081,0.00002065297,0.00003615532,0.00002771676,0.9921515,0.0009686008,0.00430302,0.002160363,0.0000150729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06224948,0.001134241,0.9224746,0.0003024625,0.0001191941,0.0003985954,0.0003658565,0.001784677,0.01117088],"genre_scores_gemma":[0.3458706,0.0005095293,0.6479729,0.0001920856,0.00003949658,0.0005052189,0.0007746703,0.000383528,0.003751907],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00959486,"threshold_uncertainty_score":0.01907802,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04137664594293828,"score_gpt":0.2521862993658344,"score_spread":0.2108096534228961,"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."}}