Coordination of dynamic lot-sizing in supply chains
提出一种新方案，协调两方供应链中的动态批量调度问题，在各方数据保密且无中央实体的情况下，通过买方生成供应提案、卖方计算成本变化，找到系统最优解。
This paper presents a new scheme for the coordination of dynamic, uncapacitated lot-sizing problems in two-party supply chains where parties’ local data are private information and no external or central entity is involved. This coordination scheme includes the following actions: At first, the buyer generates a series of different supply proposals using an extension of her local lot-sizing problem. Then the supplier calculates his cost changes that would result from the implementation of the buyer’s proposals. Based on these information, parties can identify the best proposal generated. The scheme identifies the system-wide optimum in different settings—for instance in a two-stage supply chain where the supplier’s costs for holding a period’s demand in inventory exceed his setup costs.