{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001802622,0.0002847803,0.0001870915,0.0005418868,0.001323645,0.001188998,0.001303524,0.0000262339,0.0002505765],"category_scores_gemma":[0.00004635709,0.0001903595,0.00007464172,0.002465924,0.0006122306,0.001447996,0.0005863667,0.0001336984,0.0002581744],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001347626,"about_ca_system_score_gemma":0.00002671077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006308682,"about_ca_topic_score_gemma":0.0001608095,"domain_scores_codex":[0.9969335,0.00001168464,0.0002944697,0.0007445128,0.001068676,0.0009471976],"domain_scores_gemma":[0.9988456,0.00007041173,0.0001541716,0.0006657123,0.0002265201,0.0000376188],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0007630293,0.0004246125,0.04172909,0.002433172,0.0005395117,0.0002458878,0.002947623,0.01796247,0.0005131988,0.7651135,0.09777697,0.06955091],"study_design_scores_gemma":[0.002401373,0.0000895101,0.01704204,0.0001947674,0.0002945601,0.000005697686,0.01378894,0.1051647,0.00005316684,0.003281301,0.8568534,0.000830535],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3054117,0.0004927287,0.1411382,0.01705171,0.004136615,0.01378226,0.00001300255,0.00132077,0.516653],"genre_scores_gemma":[0.9834999,0.00003957629,0.0008019082,0.003372495,0.0004149548,0.0003729519,0.00001121523,0.00004195925,0.01144506],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7618322,"threshold_uncertainty_score":0.9999765,"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."}}