A polynomial time algorithm for the economic lot-size problem with multiple transportation channels

zbMATH Open1240.90036MaRDI QIDQ3170973FDOQ3170973

Authors: Qingguo Bai, Jianteng Xu, Yuzhong Zhang 

Publication date: 29 September 2011

Recommendations

• A polynomial-time algorithm for the economic lot-size problem with multiple suppliers and multiple retailers
• A polynomial time algorithm for the two-supplier economic lot-size problem
• A polynomial time algorithm for two-echelon dynamic lot-sizing problem with multiple suppliers
• Optimal Algorithms for the Economic Lot-Sizing Problem with Multi-supplier
• Optimal solutions for the economic lot-sizing problem with multiple suppliers and cost structures

zbMATH Keywords

computational complexityeconomic lot-sizeall-unit discount function

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cited In (5)

• The Economic Lot and Delivery Scheduling Problem: Powers of Two Policies
• A polynomial time algorithm for the two-supplier economic lot-size problem
• A polynomial-time algorithm for the economic lot-size problem with multiple suppliers and multiple retailers
• An optimal polynomial time algorithm for the common cycle economic lot and delivery scheduling problem.
• A polynomial time algorithm for two-echelon dynamic lot-sizing problem with multiple suppliers

This page was built for publication: A polynomial time algorithm for the economic lot-size problem with multiple transportation channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3170973)