Coordination of a two-level supply chain with contracts

被引:0
|
作者
Siao-Leu Phouratsamay
Safia Kedad-Sidhoum
Fanny Pascual
机构
[1] IMB UMR CNRS 5251,Inria Bordeaux Sud
[2] Sorbonne Université,Ouest RealOpt
[3] CNRS,Laboratoire d’Informatique de Paris 6, LIP6
[4] CNAM-CEDRIC,undefined
来源
4OR | 2021年 / 19卷
关键词
Supply chain management; Dynamic lot-sizing; Contracts; Complexity analysis; Screening game; 90B05 Inventory, storage, reservoirs; 90B06 Transportation, logistics and supply chain management; 91-08 Computational methods for problems pertaining to game theory, economics, and finance; 68Q25 Analysis of algorithms and problem complexity; 91A68 Algorithmic game theory and complexity;
D O I
暂无
中图分类号
学科分类号
摘要
We consider the coordination of planning decisions of a single product in a supply chain composed of one supplier and one retailer, by using contracts. We assume that the retailer has the market power: he can impose his optimal replenishment plan to the supplier. Our aim is to minimize the supplier’s cost without increasing the retailer’s cost. To this end, the supplier (or a trusted third party) proposes to the retailer a contract, which is made of a replenishment plan and a side payment. This side payment compensates the increase of cost of the retailer due to the fact that the proposed replenishment plan may have a cost larger than the retailer’s optimal replenishment plan. We evaluate how much the supplier can gain by using contracts under several scenarios which depend on the side payment coverage. From a theoretical point of view, in all the scenarios, contracts may decrease the cost of the supplier by an arbitrarily large factor. We perfom experiments which measures the gain that can be obtained in practice on various instances types. If side payments are allowed, experiments show that the use of contracts decreases significantly the cost of the supplier, and that side payments on the holding costs are sufficient. We show that if there is no side payment, or if there is no constraint on the side payment, then the problem can be solved in polynomial time. On the contrary, if the side payment is limited to the holding costs of the retailer, then the problem is NP-hard. We extend this study to the case where the information is asymmetric (the supplier—or the trusted third entity—does not know all the costs of the retailer): in this case, the situation is modelled by a screening game.
引用
收藏
页码:235 / 264
页数:29
相关论文
共 50 条