A Capacitated Lot Sizing Game with Transshipments, Scarce Capacities, and Player-Dependent Cost Coefficients
- 765 Downloads
In this chapter, we investigate a game with cooperative production based on the capacitated lot sizing problem where the available resources of the players may be used jointly. As in the chapters before, two topics will be discussed: Determining the optimal production plan for the grand coalition and allocating the total costs for such a production plan among the players.
KeywordsMaster Problem Lagrangean Relaxation Grand Coalition Cost Allocation Cost Coefficient
- Geoffrion, A. M. (1974). Lagrangean Relaxation for Integer Programming. Mathematical Programming Study, 2(1), 81–114.Google Scholar
- Pochet, Y., & Wolsey, L. A. (2006). Production Planning by Mixed Integer Programming. Springer, Heidelberg.Google Scholar
- Sox, C. R., & Gao, Y. (1999). The Capacitated Lot Sizing Problem with Setup Carry-Over. IIE Transactions, 31(2), 173–181.Google Scholar