We consider a two-stage supply chain where a buyer purchases a product from multiple capacitated suppliers to satisfy a constant demand rate over a finite planning horizon. Suppliers have different perfect rates and offer total quantity discounts. The buyer selects suppliers and allocates orders to them that satisfy a minimum average quality level. A mathematical model is proposed with the objective on minimizing the total cost per time unit. The model is solved by dualizing the quality constraint. The relaxed model is solved by an efficient dynamic programming algorithm. The subgradient method is used to solve the dual problem.
|Original language||English (US)|
|Number of pages||22|
|Journal||Transportation Research Part E: Logistics and Transportation Review|
|State||Published - Nov 2018|
All Science Journal Classification (ASJC) codes
- Business and International Management
- Civil and Structural Engineering