{"id":"W2208994903","doi":"10.1007/s10107-015-0920-3","title":"The submodular joint replenishment problem","year":2015,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":34,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Defense Science and Engineering Graduate; Air Force Office of Scientific Research; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Massachusetts Institute of Technology; Division of Civil, Mechanical and Manufacturing Innovation; National Science Foundation","keywords":"Submodular set function; Holding cost; Mathematical optimization; Cardinality (data modeling); Heuristic; Mathematics; Dynamic programming; Approximation algorithm; Average cost; Job shop scheduling; Total cost; Computer science; Schedule","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001889096,0.0001922297,0.0001970056,0.0000753866,0.0003128522,0.0009046122,0.0003438611,0.00004390648,0.0001122882],"category_scores_gemma":[0.0003485449,0.0001229383,0.000112832,0.0002830409,0.0001189683,0.0004131837,0.0003825025,0.0001365434,0.001296335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007228242,"about_ca_system_score_gemma":0.00001452809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003440219,"about_ca_topic_score_gemma":0.000008510861,"domain_scores_codex":[0.9981769,0.000016759,0.0004395999,0.0002814637,0.0005800994,0.0005051703],"domain_scores_gemma":[0.9991631,0.00003956169,0.0001630555,0.0004598316,0.0001300504,0.00004440311],"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.00002217112,0.0003029298,0.0003550614,0.0004054531,0.00006102288,0.00002453114,0.0002543456,0.00002767054,0.00001891182,0.8443042,0.04586209,0.1083616],"study_design_scores_gemma":[0.0003525464,0.00002094637,0.00002589572,0.00005405163,0.00003765939,0.000002955101,0.001277228,0.007047497,0.00002845397,0.1739361,0.8170238,0.0001929225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.05492929,0.001175335,0.05644572,0.04327136,0.002450281,0.007829637,0.000001192538,0.002874808,0.8310224],"genre_scores_gemma":[0.9701407,0.000006586702,0.01817811,0.002708272,0.00201805,0.0008081668,0.00002100622,0.0001084361,0.006010688],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9152114,"threshold_uncertainty_score":0.9994813,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06011719388139675,"score_gpt":0.2406231647610436,"score_spread":0.1805059708796469,"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."}}