Search

Your search keyword '"T1"' showing total 17 results
Start Over Author "T1" Publisher maastricht university school of business and economics
17 results on '"T1"'

5. Stochastic Games with Hyperbolic Discounting

Author

Peeters, R.J.A.P., Microeconomics & Public Economics, RS: GSBE METEOR T1, RS: GSBE, and RS: GSBE METEOR T3

Subjects
c73 - "Stochastic and Dynamic Games, Evolutionary Games, Repeated Games", c72 - Noncooperative Games, stochastic game, d90 - Intertemporal Choice and Growth: General, Markov decision problem, c61 - "Optimization Techniques, Programming Models, Dynamic Analysis", hyperbolic discounting
Published
2004

11. On dominant strategy mechanisms

Author

Müller, R.J., Vohra, R., Quantitative Economics, Externe publicaties SBE, and RS: GSBE METEOR T1

Published
2003

13. Polynomial time algorithms for some multi-level lot-sizing problems with production capacities

Author

van Hoesel, C.P.M., Romeijn, H.E., Romero Morales, M.D., Wagelmans, A., Quantitative Economics, Externe publicaties SBE, and RS: GSBE METEOR T1

Subjects
dynamic programming, m11 - Production Management, lot-sizing, integration of production planning and transportation, polynomial time algorithms, r40 - Transportation Systems: General, c61 - "Optimization Techniques, Programming Models, Dynamic Analysis"
Abstract

We consider a model for a serial supply chain in which production, inventory, and transportation decisions are integrated, in the presence of production capacities and for different transportation cost functions. The model we study is a generalization of the traditional single-item economic lot-sizing model, adding stationary production capacities at the manufacturer, as well as multiple intermediate storage levels (including the retailer level), and transportation between these levels. Allowing for general concave production costs and linear holding costs, we provide polynomial time algorithms for the cases where the transportation costs are either linear, or are concave with a fixed-charge structure. In the latter case, we make the additional common and reasonable assumption that the variable transportation and inventory costs are such that holding inventories at higher levels in the supply chain is more attractive from a variable cost perspective. The running times of the algorithms are remarkably insensitive to the number of levels in the supply chain.

Published
2002

Catalog

Books, media, physical & digital resources
See catalog results