Cooperative Lot Sizing Games in Supply Chains

Business & Finance, Economics, Econometrics, Management & Leadership, Operations Research
Cover of the book Cooperative Lot Sizing Games in Supply Chains by Julia Drechsel, Springer Berlin Heidelberg
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Julia Drechsel ISBN: 9783642137259
Publisher: Springer Berlin Heidelberg Publication: August 18, 2010
Imprint: Springer Language: English
Author: Julia Drechsel
ISBN: 9783642137259
Publisher: Springer Berlin Heidelberg
Publication: August 18, 2010
Imprint: Springer
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Springer Berlin Heidelberg

Cover of the book Pediatric Chest Imaging by Julia Drechsel
Cover of the book High Resolution Microbial Single Cell Analytics by Julia Drechsel
Cover of the book Metastable States in Amorphous Chalcogenide Semiconductors by Julia Drechsel
Cover of the book Energy and Non-Traditional Security (NTS) in Asia by Julia Drechsel
Cover of the book Signalling from Internalised Growth Factor Receptors by Julia Drechsel
Cover of the book Introducing Corpus-based Translation Studies by Julia Drechsel
Cover of the book Cavity-Enhanced Spectroscopy and Sensing by Julia Drechsel
Cover of the book Foundations of Digital Government by Julia Drechsel
Cover of the book Temperature Regulation in Humans and Other Mammals by Julia Drechsel
Cover of the book Nosokomiale Pneumonie by Julia Drechsel
Cover of the book Osteoarthritis by Julia Drechsel
Cover of the book Traumatic Subarachnoid Haemorrhage by Julia Drechsel
Cover of the book Surgical Oncology by Julia Drechsel
Cover of the book Air Pollution by Julia Drechsel
Cover of the book Progress in Spatial Analysis by Julia Drechsel
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy