Drechsel Cooperative Lot Sizing Games in Supply Chains

2010
ISBN: 978-3-642-13725-9
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, Band 644, 167 Seiten

Reihe: Lecture Notes in Economics and Mathematical Systems

Julia Drechsel worked as research assistant at the universities of Freiberg and Duisburg-Essen, Germany from 2005-2009. Since 2009 she is Senior Process Specialist for Supply Chain Optimization with Bayer Technology Services.

Autoren/Hrsg.

Drechsel, Julia

Inhaltsverzeichnis

1;Preface;6
2;Contents;8
3;List of Figures;12
4;List of Tables;14
5;Chapter 1 Introduction;16
6;Chapter 2 Selected Topics in Cooperative Game Theory;19
6.1;2.1 History of Game Theory;19
6.2;2.2 Basics in Cooperative Game Theory;22
6.2.1;2.2.1 A Cooperative Game;23
6.2.2;2.2.2 Properties of Cooperative Games;25
6.2.3;2.2.3 Variants and Fundamental Applications of the Classical Cooperative Game;27
6.2.4;2.2.4 Interval-Valued Games;29
6.3;2.3 Allocating Cooperative Costs;31
6.3.1;2.3.1 Motivation and Classification of Allocation Methods;31
6.3.2;2.3.2 Properties of Cost Allocations;32
6.3.3;2.3.3 Non-Game-Theoretical Cost Allocation Methods;34
6.3.4;2.3.4 The Core;36
6.3.5;2.3.5 Additive Core Variants;40
6.3.6;2.3.6 Multiplicative Core Variants;43
6.3.7;2.3.7 The Subcoalition-Perfect Core;46
6.3.8;2.3.8 The Interval Core;50
6.3.9;2.3.9 The Shapley Value;51
6.3.10;2.3.10 Conclusions;52
7;Chapter 3 Algorithmic Game Theory;54
7.1;3.1 Literature;55
7.2;3.2 Computing Core Cost Allocations;56
7.3;3.3 Theoretical Background;58
7.4;3.4 Including Fairness Criteria;59
7.5;3.5 Computing Core Variants;62
7.6;3.6 Computing Interval Core Elements;64
7.7;3.7 Conclusions;65
8;Chapter 4 Cooperation in Supply Chains;67
8.1;4.1 Horizontal versus Vertical Cooperation;68
8.2;4.2 Supply Chain Games in the Literature;71
9;Chapter 5 An Economic Lot Sizing Game;74
9.1;5.1 Cooperative Ordering Situations;74
9.1.1;5.1.1 The Underlying Problem;74
9.1.2;5.1.2 Properties of the ELS Game;76
9.2;5.2 Computing Core Cost Allocations for the ELS Game;76
9.2.1;5.2.1 The Row Generation Procedure;77
9.2.2;5.2.2 A Numerical Example;80
9.3;5.3 Computational Study for the ELS Game;84
9.4;5.4 Extensions for the ELS Game;90
10;Chapter 6 A Lot Sizing Game with Uncertain Demand;92
10.1;6.1 The Underlying Problem;92
10.2;6.2 Special Phenomena of Interval Cores;93
10.3;6.3 A New Definition of the Interval Core and Its Computation;94
10.4;6.4 Computational Study for the Interval ELS Game;96
11;Chapter 7 A Capacitated Lot Sizing Game with Transshipments, Scarce Capacities, and Player-Dependent Cost Coefficients;97
11.1;7.1 Cooperative Production Situations;97
11.1.1;7.1.1 The Underlying Problem;97
11.1.2;7.1.2 The CLSP Game;99
11.1.3;7.1.3 Properties of the CLSP Game;103
11.2;7.2 Solving the Cooperative CLSP;104
11.2.1;7.2.1 A Lagrangean Relaxation Based Heuristic;104
11.2.2;7.2.2 A Fix-and-Optimize Heuristic;108
11.3;7.3 Computing Core Cost Allocations for the CLSP Game;111
11.3.1;7.3.1 The Row Generation Procedure;111
11.3.2;7.3.2 Computing the Subcoalition-Perfect Core;114
11.3.3;7.3.3 Computing the Minmax Core;116
11.4;7.4 Computational Study for the CLSP Game;116
11.4.1;7.4.1 Computational Study: Lagrangean RelaxationBased Heuristic;117
11.4.2;7.4.2 Computational Study: Fix-and-Optimize Heuristic;119
11.4.3;7.4.3 Computational Study: Subcoalition-Perfect Core;124
11.4.4;7.4.4 Computational Study: Minmax Core;125
11.5;7.5 Extensions for the CLSP Game;127
12;Chapter 8 A Multilevel Lot Sizing Game with Restricted Cooperation;129
12.1;8.1 Cooperative Supply Situations;129
12.1.1;8.1.1 The Underlying Problem;129
12.1.2;8.1.2 Games with Restricted Cooperation;134
12.1.3;8.1.3 Properties of the MLCLSP Game;139
12.2;8.2 Computing Core Cost Allocations for the MLCLSP Game;139
12.2.1;8.2.1 The Row Generation Procedure;140
12.2.2;8.2.2 A Numerical Example;143
12.2.3;8.2.3 Computing Core Variants;145
12.3;8.3 Computational Study for the MLCLSP Game;146
13;Chapter 9 Conclusions and Future Research;151
14;Appendix A Computational Study CLSP Game;154
14.1;A.1 Computational Study: Lagrangean Relaxation Based Heuristic;154
14.2;A.2 Computational Study: Fix-and-Optimize Heuristic;158
15;Appendix B Computational Study MLCLSP Game;159
16;Bibliography;163