Economic lot-sizing games
Author
Abstract
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
Suggested Citation
Download full text from publisher
Other versions of this item:
- Heuvel, Wilco van den & Borm, Peter & Hamers, Herbert, 2007. "Economic lot-sizing games," European Journal of Operational Research, Elsevier, vol. 176(2), pages 1117-1130, January.
- van den Heuvel, W. & Borm, P.E.M. & Hamers, H.J.M., 2004. "Economic Lot-Sizing Games," ERIM Report Series Research in Management ERS-2004-088-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
- van den Heuvel, W. & Borm, P.E.M. & Hamers, H.J.M., 2004. "Economic lot-sizing games," Other publications TiSEM 523ee90a-3486-4cf9-be95-7, Tilburg University, School of Economics and Management.
References listed on IDEAS
- Peter Borm & Herbert Hamers & Ruud Hendrickx, 2001.
"Operations research games: A survey,"
TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 9(2), pages 139-199, December.
- Borm, P.E.M. & Hamers, H.J.M. & Hendrickx, R.L.P., 2001. "Operations research games : A survey," Other publications TiSEM 755a430b-592f-400b-ba18-9, Tilburg University, School of Economics and Management.
- Borm, P.E.M. & Hamers, H.J.M. & Hendrickx, R.L.P., 2001. "Operations Research Games : A Survey," Other publications TiSEM 04f265e0-8043-4d4f-bf27-2, Tilburg University, School of Economics and Management.
- Borm, P.E.M. & Hamers, H.J.M. & Hendrickx, R.L.P., 2001. "Operations Research Games : A Survey," Discussion Paper 2001-45, Tilburg University, Center for Economic Research.
- Meca, Ana & Timmer, Judith & Garcia-Jurado, Ignacio & Borm, Peter, 2004.
"Inventory games,"
European Journal of Operational Research, Elsevier, vol. 156(1), pages 127-139, July.
- Meca-Martinez, A. & Timmer, J.B. & Garcia-Jurado, I. & Borm, P.E.M., 1999. "Inventory Games," Discussion Paper 1999-53, Tilburg University, Center for Economic Research.
- Meca-Martinez, A. & Timmer, J.B. & Garcia-Jurado, I. & Borm, P.E.M., 1999. "Inventory Games," Other publications TiSEM 21f26b3f-7fae-4f19-908f-a, Tilburg University, School of Economics and Management.
- Meca, A. & Timmer, J.B. & Garcia-Jurado, I. & Borm, P.E.M., 2004. "Inventory games," Other publications TiSEM 49368f2d-02fc-49c9-9d74-8, Tilburg University, School of Economics and Management.
- Albert Wagelmans & Stan van Hoesel & Antoon Kolen, 1992. "Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case," Operations Research, INFORMS, vol. 40(1-supplem), pages 145-156, February.
- Harvey M. Wagner & Thomson M. Whitin, 1958. "Dynamic Version of the Economic Lot Size Model," Management Science, INFORMS, vol. 5(1), pages 89-96, October.
- Lloyd S. Shapley, 1967. "On balanced sets and cores," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 14(4), pages 453-460.
- Ichiishi, Tatsuro, 1981. "Super-modularity: Applications to convex games and to the greedy algorithm for LP," Journal of Economic Theory, Elsevier, vol. 25(2), pages 283-286, October.
- Awi Federgruen & Michal 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, INFORMS, vol. 37(8), pages 909-925, August.
- Alok Aggarwal & James K. Park, 1993. "Improved Algorithms for Economic Lot Size Problems," Operations Research, INFORMS, vol. 41(3), pages 549-571, June.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- repec:ems:eureir:1796 is not listed on IDEAS
- Drechsel, J. & Kimms, A., 2010. "Computing core allocations in cooperative games with an application to cooperative procurement," International Journal of Production Economics, Elsevier, vol. 128(1), pages 310-321, November.
- Siao-Leu Phouratsamay & Safia Kedad-Sidhoum & Fanny Pascual, 2021. "Coordination of a two-level supply chain with contracts," 4OR, Springer, vol. 19(2), pages 235-264, June.
- Wolosewicz, Cathy & Dauzère-Pérès, Stéphane & Aggoune, Riad, 2015. "A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem," European Journal of Operational Research, Elsevier, vol. 244(1), pages 3-12.
- Stan van Hoesel & H. Edwin Romeijn & Dolores Romero Morales & Albert P. M. Wagelmans, 2005. "Integrated Lot Sizing in Serial Supply Chains with Production Capacities," Management Science, INFORMS, vol. 51(11), pages 1706-1719, November.
- Hark‐Chin Hwang & Wilco van den Heuvel, 2012.
"Improved algorithms for a lot‐sizing problem with inventory bounds and backlogging,"
Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(3‐4), pages 244-253, April.
- Hwang, H.C. & van den Heuvel, W., 2010. "Improved Algorithms for a Lot-Sizing Problem with Inventory Bounds and Backlogging," Econometric Institute Research Papers EI 2010-17, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
- Martel, Alain & Gascon, Andre, 1998. "Dynamic lot-sizing with price changes and price-dependent holding costs," European Journal of Operational Research, Elsevier, vol. 111(1), pages 114-128, November.
- Nadjib Brahimi & Stéphane Dauzère-Pérès & Najib M. Najid, 2006. "Capacitated Multi-Item Lot-Sizing Problems with Time Windows," Operations Research, INFORMS, vol. 54(5), pages 951-967, October.
- Yongpei Guan, 2011. "Stochastic lot-sizing with backlogging: computational complexity analysis," Journal of Global Optimization, Springer, vol. 49(4), pages 651-678, April.
- van den Heuvel, Wilco & Wagelmans, Albert P.M., 2006.
"A polynomial time algorithm for a deterministic joint pricing and inventory model,"
European Journal of Operational Research, Elsevier, vol. 170(2), pages 463-480, April.
- van den Heuvel, W. & Wagelmans, A.P.M., 2003. "A Polynomial Time Algorithm for a Deterministic Joint Pricing and Inventory Model," ERIM Report Series Research in Management ERS-2003-065-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
- Romeijn, H.E. & van den Heuvel, W.J. & Geunes, J., 2012. "Mitigating the Cost of Anarchy in Supply Chain Systems," Econometric Institute Research Papers EI 2012-03, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
- Hark-Chin Hwang, 2010. "Economic Lot-Sizing for Integrated Production and Transportation," Operations Research, INFORMS, vol. 58(2), pages 428-444, April.
- Chung-Lun Li & Qingying Li, 2016. "Polynomial-Time Solvability of Dynamic Lot Size Problems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(03), pages 1-20, June.
- Hark-Chin Hwang & Hyun-Soo Ahn & Philip Kaminsky, 2013. "Basis Paths and a Polynomial Algorithm for the Multistage Production-Capacitated Lot-Sizing Problem," Operations Research, INFORMS, vol. 61(2), pages 469-482, April.
- Hark-Chin Hwang, 2009. "Inventory Replenishment and Inbound Shipment Scheduling Under a Minimum Replenishment Policy," Transportation Science, INFORMS, vol. 43(2), pages 244-264, May.
- Hwang, Hark-Chin & Kang, Jangha, 2020. "The two-level lot-sizing problem with outbound shipment," Omega, Elsevier, vol. 90(C).
- Fink, Jiří & Hurink, Johann L., 2015. "Minimizing costs is easier than minimizing peaks when supplying the heat demand of a group of houses," European Journal of Operational Research, Elsevier, vol. 242(2), pages 644-650.
- Goisque, Guillaume & Rapine, Christophe, 2017. "An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels," European Journal of Operational Research, Elsevier, vol. 261(3), pages 918-928.
- Laurence A. Wolsey, 2002. "Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation," Management Science, INFORMS, vol. 48(12), pages 1587-1602, December.
- van den Heuvel, W.J. & Wagelmans, A.P.M., 2008. "A holding cost bound for the economic lot-sizing problem with time-invariant cost parameters," Econometric Institute Research Papers EI 2008-10, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
- Bian, Yuan & Lemoine, David & Yeung, Thomas G. & Bostel, Nathalie & Hovelaque, Vincent & Viviani, Jean-laurent & Gayraud, Fabrice, 2018.
"A dynamic lot-sizing-based profit maximization discounted cash flow model considering working capital requirement financing cost with infinite production capacity,"
International Journal of Production Economics, Elsevier, vol. 196(C), pages 319-332.
- Yuan Bian & David Lemoine & Thomas G. Yeung & Nathalie Bostel & Vincent Hovelaque & Jean-Laurent Viviani & Fabrice Gayraud, 2018. "A dynamic lot-sizing-based profit maximization discounted cash flow model considering working capital requirement financing cost with infinite production capacity," Post-Print halshs-01683781, HAL.
More about this item
JEL classification:
- C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
- M - Business Administration and Business Economics; Marketing; Accounting; Personnel Economics
- M11 - Business Administration and Business Economics; Marketing; Accounting; Personnel Economics - - Business Administration - - - Production Management
- R4 - Urban, Rural, Regional, Real Estate, and Transportation Economics - - Transportation Economics
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:tiu:tiutis:f559452b-09d9-4a51-9b9d-1f1938f1a212. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Richard Broekman (email available below). General contact details of provider: https://www.tilburguniversity.edu/about/schools/economics-and-management/ .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.