Descripción del título
Cooperative Lot Sizing Game...
The presented work combines two areas of research: cooperative game theory and lot size optimization. One of the most essential problems in cooperations is to allocate cooperative profits or costs among the partners. The core is a well known method from cooperative game theory that describes efficient and stable profit/cost allocations. A general algorithm based on the idea of constraint generation to compute core elements for cooperative optimization problems is provided. Beside its application for the classical core, an extensive discussion of core variants is presented and how they can be handled with the proposed algorithm. The second part of the thesis contains several cooperative lot sizing problems of different complexity that are analyzed regarding theoretical properties like monotonicity or concavity and solved with the proposed row generation algorithm to compute core elements; i.e. determining stable and fair cost allocations
Monografía
monografia Rebiun05925553 https://catalogo.rebiun.org/rebiun/record/Rebiun05925553 100825s2010 gw | s |||| 0|eng d 9783642137259 978-3-642-13725-9 9783642137242 ed. impresa) UMA.RE Drechsel, Julia Cooperative Lot Sizing Games in Supply Chains Recurso electrónico] by Julia Drechsel Servicio en línea Berlin, Heidelberg Springer Berlin Heidelberg Imprint: Springer 2010 Berlin, Heidelberg Berlin, Heidelberg Springer Berlin Heidelberg Imprint: Springer XIV, 167p. 20 illus., 10 illus. in color. digital XIV, 167p. 20 illus., 10 illus. in color. Lecture Notes in Economics and Mathematical Systems 0075-8442 644 Introduction -- Selected Topics in Cooperative Game Theory -- Algorithmic Game Theory -- Cooperation in Supply Chains -- An Economic Lot Sizing Game -- A Lot Sizing with Uncertain Demand -- A Capacitated Lot Sizing Game with Transshipments, Scarce Capacities, and Player-Dependent Cost Coefficients -- A Multilevel Lot Sizing Game with Restricted Cooperation -- Conclusion and Future Outlook -- Appendix: Computational Study MLCLSP Game Acceso restringido a miembros del Consorcio de Bibliotecas Universitarias de Andalucía The presented work combines two areas of research: cooperative game theory and lot size optimization. One of the most essential problems in cooperations is to allocate cooperative profits or costs among the partners. The core is a well known method from cooperative game theory that describes efficient and stable profit/cost allocations. A general algorithm based on the idea of constraint generation to compute core elements for cooperative optimization problems is provided. Beside its application for the classical core, an extensive discussion of core variants is presented and how they can be handled with the proposed algorithm. The second part of the thesis contains several cooperative lot sizing problems of different complexity that are analyzed regarding theoretical properties like monotonicity or concavity and solved with the proposed row generation algorithm to compute core elements; i.e. determining stable and fair cost allocations Modo de acceso: World Wide Web Springer Economics Economics, Mathematical Operations research Economics/Management Science Game Theory/Mathematical Methods Operation Research/Decision Theory Production/Logistics/Supply Chain Management SpringerLink (Online service) SpringerLink eBooks (Servicio en línea) Lecture Notes in Economics and Mathematical Systems (Servicio en línea) Springer eBooks Springer eBooks