{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T07:19:38Z","timestamp":1762154378998,"version":"build-2065373602"},"reference-count":24,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7259,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1993,9]]},"DOI":"10.1016\/0166-218x(93)90016-h","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:28:29Z","timestamp":1027639709000},"page":"291-312","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"title":["Sensitivity analysis of the economic lot-sizing problem"],"prefix":"10.1016","volume":"45","author":[{"given":"Stan","family":"Van Hoesel","sequence":"first","affiliation":[]},{"given":"Albert","family":"Wagelmans","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)90016-H_BIB1","series-title":"Working paper","article-title":"Improved algorithms for economic lot-size problems","author":"Aggarwal","year":"1990"},{"year":"1974","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","key":"10.1016\/0166-218X(93)90016-H_BIB2"},{"key":"10.1016\/0166-218X(93)90016-H_BIB3","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0377-2217(82)90176-X","article-title":"Worst case performance of lot-sizing heuristics","volume":"9","author":"Axs\u00e4ter","year":"1982","journal-title":"European J. Oper. Res."},{"key":"10.1016\/0166-218X(93)90016-H_BIB4","first-page":"199","article-title":"Lot-sizing procedures and a standard data set: a reconciliation of the literature","volume":"2","author":"Baker","year":"1990","journal-title":"J. Manufacturing Oper. Management"},{"key":"10.1016\/0166-218X(93)90016-H_BIB5","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1287\/mnsc.30.9.1121","article-title":"Approximation methods for the uncapacitated dynamic lot size problem","volume":"30","author":"Bitran","year":"1984","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(93)90016-H_BIB6","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1287\/mnsc.15.5.268","article-title":"Extensions of the planning horizon theorem in the dynamic lot size problem","volume":"15","author":"Eppen","year":"1969","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(93)90016-H_BIB7","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0272-6963(85)90009-9","article-title":"An efficient implementation of the Wagner\u2013Whitin algorithm for dynamic lot-sizing","volume":"5","author":"Evans","year":"1985","journal-title":"J. Oper. Management"},{"key":"10.1016\/0166-218X(93)90016-H_BIB8","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1287\/mnsc.37.8.909","article-title":"A simple forward algorithm to solve general dynamic lot sizing models with n periods in O(n log n) or O(n) time","volume":"37","author":"Federgruen","year":"1991","journal-title":"Management Sci"},{"key":"10.1016\/0166-218X(93)90016-H_BIB9","series-title":"Report","article-title":"On sensitivity analysis for shortest-path dynamic programming models","author":"Lee","year":"1986"},{"key":"10.1016\/0166-218X(93)90016-H_BIB10","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1287\/opre.23.4.711","article-title":"Planning horizons for the dynamic lot size model: Zabel vs. protective procedures and computational results","volume":"23","author":"Lundin","year":"1975","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(93)90016-H_BIB11","first-page":"99","article-title":"The two-criterial dynamic lot size problem","author":"Richter","year":"1986","journal-title":"System Anal. Modelling Simulation"},{"key":"10.1016\/0166-218X(93)90016-H_BIB12","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0377-2217(87)90137-8","article-title":"Stability of the constant cost dynamic lot size model","volume":"31","author":"Richter","year":"1987","journal-title":"European J. Oper. Res."},{"key":"10.1016\/0166-218X(93)90016-H_BIB13","first-page":"67","article-title":"A parametric analysis of the dynamic lot-sizing problem","volume":"25","author":"Richter","year":"1989","journal-title":"J. Inform. Process. Cybernet."},{"key":"10.1016\/0166-218X(93)90016-H_BIB14","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0377-2217(89)90380-9","article-title":"On the stability region for the multi-level inventory problems","volume":"41","author":"Richter","year":"1989","journal-title":"European J. Oper. Res."},{"key":"10.1016\/0166-218X(93)90016-H_BIB15","first-page":"15","article-title":"A fast microcomputer program for ordering using the Wagner\u2013Whitin algorithm","volume":"28","author":"Saydan","year":"1987","journal-title":"Production Inventory Management J."},{"key":"10.1016\/0166-218X(93)90016-H_BIB16","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1137\/0204032","article-title":"On finding and updating spanning trees and shortest paths","volume":"4","author":"Spira","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(93)90016-H_BIB17","series-title":"Ph.D. dissertation","article-title":"Models and algorithms for single item lot-sizing problems","author":"Van Hoesel","year":"1991"},{"key":"10.1016\/0166-218X(93)90016-H_BIB18","first-page":"112","article-title":"A note on \u201cStability of the constant cost dynamic lot size model\u201d","volume":"55","author":"Van Hoesel","year":"1991"},{"article-title":"Sensitivity analysis in combinatorial optimization","year":"1990","author":"Wagelmans","key":"10.1016\/0166-218X(93)90016-H_BIB19"},{"key":"10.1016\/0166-218X(93)90016-H_BIB20","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1287\/opre.40.1.S145","article-title":"Economic lot-sizing: an O(n log n) algorithm that runs in linear time in the Wagner\u2013Whitin case","volume":"40","author":"Wagelmans","year":"1992","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(93)90016-H_BIB21","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1002\/nav.3800070103","article-title":"A postscript to dynamic problems in the theory of the firm","volume":"7","author":"Wagner","year":"1960","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0166-218X(93)90016-H_BIB22","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1287\/mnsc.5.1.89","article-title":"Dynamic version of the economic lot size model","volume":"5","author":"Wagner","year":"1958","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(93)90016-H_BIB23","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1287\/mnsc.10.3.465","article-title":"Some generalizations of an inventory planning horizon theorem","volume":"10","author":"Zabel","year":"1964","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(93)90016-H_BIB24","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1287\/mnsc.14.7.429","article-title":"Minimum concave cost flows in certain networks","volume":"14","author":"Zangwill","year":"1968","journal-title":"Management Sci."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390016H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390016H?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T07:14:37Z","timestamp":1762154077000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9390016H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["0166218X9390016H"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)90016-h","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[1993,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Sensitivity analysis of the economic lot-sizing problem","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0166-218X(93)90016-H","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1993 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}