420
Views
5
CrossRef citations to date
0
Altmetric
Articles

The effect of economies-of-scale on the performance of lot-sizing heuristics in rolling horizon basis

ORCID Icon, ORCID Icon, ORCID Icon, & ORCID Icon
Pages 2294-2308 | Received 21 Mar 2019, Accepted 09 Feb 2020, Published online: 26 Feb 2020

References

  • Aggarwal, A., and J. K. Park. 1993. “Improved Algorithms for Economic Lot Size Problems.” Operations Research 41 (3): 549–571.
  • Axsäter, S. 1982. “Worst Case Performance for Lot Sizing Heuristics.” European Journal of Operational Research 9 (4): 339–343.
  • Axsäter, S. 1985. “Note – performance Bounds for Lot Sizing Heuristics.” Management Science 31 (5): 634–640.
  • Baciarello, L., M. D'Avino, R. Onori, and M. M. Schiraldi. 2013. “Lot Sizing Heuristics Performance.” International Journal of Engineering Business Management 5 (6): 1–10.
  • Blackburn, J. D., and R. A. Millen. 1980. “Heuristic Lot-sizing Performance in a Rolling-schedule Environment*.” Decision Sciences 11 (4): 691–701.
  • Chand, S., V. N. Hsu, and S. Sethi. 2002. “Forecast, Solution, and Rolling Horizons in Operations Management Problems: a Classified Bibliography.” Manufacturing & Service Operations Management 4 (1): 25–43.
  • Chu, L. Y., V. N. Hsu, and Z. -J. M. Shen. 2005. “An Economic Lot-sizing Problem with Perishable Inventory and Economies of Scale Costs: Approximation Solutions and Worst Case Analysis.” Naval Research Logistics (NRL) 52 (6): 536–548.
  • Federgruen, A., and M. Tzur. 1991. “A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with N Periods in 0 (n Log N) Or 0 (n) Time.” Management Science 37 (8): 909–925.
  • Florian, M., and M. Klein. 1971. “Deterministic Production Planning with Concave Costs and Capacity Constraints.” Management Science 18 (1): 12–20.
  • Florian, M., J. K. Lenstra, and A. Rinnooy Kan. 1980. “Deterministic Production Planning: Algorithms and Complexity.” Management Science 26 (7): 669–679.
  • Heck, M., and G. Schmidt. 2010. Lot-Size Planning with Non-Linear Cost Functions Supporting Environmental Sustainability. In Networked Digital Technologies, Part II: Second International Conference, NDT 2010, Prague, Czech Republic, July 7-9, 2010 Proceedings, edited by Filip Zavoral, Jakub Yaghob, Pit Pichappan and Eyas El-Qawasmeh, vol 88, 1–6. Springer.
  • Hopp, W. J., and M. L. Spearman. 2011. Factory Physics. Long Grove, IL: Waveland Press. ISBN:1-57766-739-1.
  • Kian, R. 2016. “Production Decisions with Convex Costs and Carbon Emission Constraints.” PhD thesis, Bilkent University.
  • Kian, R., E. Berk, and Ü. Gürler. 2019. “Minimal Conic Quadratic Reformulations and An Optimization Model.” Operations Research Letters 47 (6): 489–493.
  • Kian, R., Ü. Gürler, and E. Berk. 2014. “The Dynamic Lot-sizing Problem with Convex Economic Production Costs and Setups.” International Journal of Production Economics 155: 361–379.
  • Koca, E., H. Yaman, and M. S. Aktürk. 2015. “Stochastic Lot Sizing Problem with Controllable Processing Times.” Omega 53: 1–10.
  • Russell, R., and T. Urban. 1993. “Horizon Extension for Rolling Production Schedules: Length and Accuracy Requirements.” International Journal of Production Economics 29 (1): 111–122.
  • Sahin, F., A. Narayanan, and E. P. Robinson. 2013. “Rolling Horizon Planning in Supply Chains: Review, Implications and Directions for Future Research.” International Journal of Production Research 51 (18): 5413–5436.
  • Saif, U., Z. Guan, C. Wang, C. He, L. Yue, and J. Mirza. 2019. “Drum Buffer Rope-based Heuristic for Multi-level Rolling Horizon Planning in Mixed Model Production.” International Journal of Production Research 57: 1–28.
  • Simpson, N. 2001. “Questioning the Relative Virtues of Dynamic Lot Sizing Rules.” Computers & Operations Research 28 (9): 899–914.
  • Stadtler, H. 2000. “Improved Rolling Schedules for the Dynamic Single-level Lot-sizing Problem.” Management Science 46 (2): 318–326.
  • Teksan, Z. M., and J. Geunes. 2015. “A Polynomial Time Algorithm for Convex Cost Lot-sizing Problems.” Operations Research Letters 43 (4): 359–364.
  • Teksan, Z. M., and J. Geunes. 2016. “Production Planning with Price-dependent Supply Capacity.” IIE Transactions 48 (10): 938–954.
  • Toy, A. Ö., and E. Berk. 2013. “Dynamic Lot Sizing for a Warm/cold Process: Heuristics and Insights.” International Journal of Production Economics 145 (1): 53–66.
  • Van Den Heuvel, W., and A. P. Wagelmans. 2005. “A Comparison of Methods for Lot-sizing in a Rolling Horizon Environment.” Operations Research Letters 33 (5): 486–496.
  • Van Hoesel, S., R. Kuik, M. Salomon, and L. N. Van Wassenhove. 1994. “The Single-item Discrete Lotsizing and Scheduling Problem: Optimization by Linear and Dynamic Programming.” Discrete Applied Mathematics 48 (3): 289–303.
  • Veinott, A. F. 1964. “Production Planning with Convex Costs: A Parametric Study.” Management Science 10 (3): 441–460.
  • Wagelmans, A., S. Van Hoesel, and A. Kolen. 1992. “Economic Lot Sizing: An O (n Log N) Algorithm that Runs in Linear Time in the Wagner-Whitin Case.” Operations Research 40 (1-supplement-1): S145–S156.
  • Wagner, H. M. 1960. “A Postscript to ‘dynamic Problems in the Theory of the Firm’.” Naval Research Logistics Quarterly 7 (1): 7–12.
  • Wagner, H. M., and T. M. Whitin. 1958. “Dynamic Version of the Economic Lot Size Model.” Management Science 5 (1): 89–96.
  • Wemmerlöv, U., and D. C. Whybark. 1984. “Lot-sizing Under Uncertainty in a Rolling Schedule Environment.” The International Journal of Production Research 22 (3): 467–484.
  • Ziarnetzky, T., L. Mönch, and R. Uzsoy. 2018. “Rolling Horizon, Multi-product Production Planning with Chance Constraints and Forecast Evolution for Wafer Fabs.” International Journal of Production Research 56 (18): 6112–6134.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.