Joern Meissner is Professor of Supply Chain Management & Pricing Strategy at Kühne Logistics University. Meissner holds a PhD and a Master’s Degree in Management Science from the Graduate School of Business at Columbia University (Columbia Business School) in New York City and a Diploma in Business from the University of Hamburg. His research spans a wide field of study, including the areas of Supply Chain Management (SCM), Pricing Strategy and Revenue Management. His work has been published in various prestigious journals including Operations Research, Manufacturing and Service Operation Management (MSOM), European Journal of Operational Research, International Journal of Production Research, International Journal of Production Economics and Naval Research Logistics.
Meissner’s main research focus is the area of stochastic and dynamic decision-making, and in particular applications to logistics, manufacturing, supply chain management, and pricing strategy. The aim of his research is to develop and implement robust and efficient techniques to business problems in those domains. A common theme within his research is the use of mathematical optimization techniques such as dynamic programming to guide managers to make better business decisions. Currently, Meissner pursues the following research streams:
- Global Supply Chain Optimization
This research focuses on how to efficiently integrate suppliers, producers, and warehouses to produce and distribute the right quantity, at the right time and in the right place while maximizing the total supply chain profit and guaranteeing an appropriate service level. Research questions often focus on incentives for the business partners to align their individual behavior with the goals of the total supply chain.
- Improvements in Inventory Control
Control of inventory is a complex task, in particular if it involves a large number of SKUs (stock-keeping units) with intermittent demand patterns, which make forecasting and inventory control very difficult. Due to the large amount of spare part SKUs held in many companies, it is often not possible to configure an inventory system manually for each part separately. Our research evaluates, for example, a sub-grouping of intermittent demand patterns by a categorization scheme and the quality of the resulting inventory control policies.
- Operations & Service Management
Service management is integrated into supply chain management as the interface between sales/after-sales and the customer. The aim of high performance service management is to optimize the service-intensive supply chains, which are usually more complex than supply chains concerned exclusively with finished goods. Companies often must accommodate inconsistent and uncertain demand by establishing more advanced information. A typical research question within this context is staffing of call centers or teller stations, for example.
- Pricing Strategy & Revenue Management
Recent advances in pricing and revenue management have rapidly changed the environment in which firms operate. The Internet, the adoption of new information technologies, and other market forces are driving the need for more sophisticated pricing methodologies and techniques. Given the tremendous upside of better pricing strategies, more and more industries are adapting mathematical pricing models to their needs. Promising research directions include sophisticated models of consumer behavior, models including competition between different providers, and the evaluation of pricing mechanisms such as auctions. These are very important issues for today's managers and research in this area is promising from both a theoretical and empirical perspective.
As a leading expert in the development of optimization algorithms for a variety of logistics, supply chain management and pricing problems, Joern Meissner is often consulted by industry professionals and helps firms apply his cutting-edge mathematical techniques to their current business problems. He frequently advises companies, ranging from Fortune 500 companies to emerging start-ups, on issues such as supply chain planning and pricing strategy. His current and past clients include British Telecom (BT), British Airways, Apple Europe, Pernod Ricard, Promethean, TUI, The Co-Operative, Littlewoods, Virgin Trains, Virgin Cargo and SAP Germany, among others.
Meissner is a passionate and enthusiastic teacher. He believes that grasping an idea is only half of the fun; conveying it to others makes it whole. At his previous position at Lancaster University Management School, he taught the MBA Core course in Operations Management and originated three new MBA Electives: Advanced Decision Models, Supply Chain Management, and Revenue Management. He has also lectured at the University of Hamburg, the Leipzig Graduate School of Management (HHL), and the University of Mannheim. Meissner offers a variety of Executive Education courses aimed at business professionals, managers, leaders, and executives who strive for professional and personal growth.
In the past, Meissner has also been a successful entrepreneur. He founded Manhattan Review, a global test preparation and admissions consultancy, during his time at Columbia Business School. More recently, he established Lancaster Executive, a provider of executive education programs for senior managers.
For more details about Joern Meissner, including downloads of research articles and white papers, please visit his academic homepage at http://www.meiss.com.
Maglaras, Constantinos and Joern Meissner (2006):Dynamic Pricing Strategies for Multi-Product Revenue Management Problems, Manufacturing & Service Operations Management, 8(2): 136-148.
Federgruen, Awi, Joern Meissner and Michal Tzur (2007):Progressive Interval Heuristics for the Multi-Item Capacitated Lot Sizing Problems, Operations Research, 55(3): 490-502.
Meissner, Joern and Arne K. Strauss (2012):Network revenue management with inventory-sensitive bid prices and customer choice, European Journal of Operational Research, 216(2): 459-468.
Abstract: We develop an approximate dynamic programming approach to network revenue management models with customer choice that approximates the value function of the Markov decision process with a non-linear function which is separable across resource inventory levels. This approximation can exhibit significantly improved accuracy compared to currently available methods. It further allows for arbitrary aggregation of inventory units and thereby reduction of computational workload, yields upper bounds on the optimal expected revenue that are provably at least as tight as those obtained from previous approaches. Computational experiments for the multinomial logit choice model with distinct consideration sets show that policies derived from our approach can outperform some recently proposed alternatives, and we demonstrate how aggregation can be used to balance solution quality and runtime.
Meissner, Joern, Arne K. Strauss and Kalyan Talluri (2013):An enhanced concave program relaxation for choice network revenue management, Production and Operations Management, 22(1): 71-87.
Abstract: The network choice revenue management problem models customers as choosing from an offer set, and the firm decides the best subset to offer at any given moment to maximize expected revenue. The resulting dynamic program for the firm is intractable and approximated by a deterministic linear program called the CDLP which has an exponential number of columns. However, under the choice-set paradigm when the segment consideration sets overlap, the CDLP is difficult to solve. Column generation has been proposed but finding an entering column has been shown to be NP-hard. In this study, starting with a concave program formulation called SDCP that is based on segment-level consideration sets, we add a class of constraints called product constraints (σPC), that project onto subsets of intersections. In addition, we propose a natural direct tightening of the SDCP called inline image, and compare the performance of both methods on the benchmark data sets in the literature. In our computational testing on the data sets, 2PC achieves the CDLP value at a fraction of the CPU time taken by column generation. For a large network our 2PC procedure runs under 70 seconds to come within 0.02% of the CDLP value, while column generation takes around 1 hour; for an even larger network with 68 legs, column generation does not converge even in 10 hours for most of the scenarios while 2PC runs under 9 minutes. Thus we believe our approach is very promising for quickly approximating CDLP when segment consideration sets overlap and the consideration sets themselves are relatively small.
No content available yet.
Teaching at KLU
Professor of Supply Chain Management & Pricing Strategy at Kühne Logistics University
|2005 - 2011|
Lecturer in Management Science, Lancaster University Management School.
Ph.D., Columbia University, Graduate School of Business, New York. Thesis: Multi-Item Supply Chain and Revenue Management Problems. Advisors: Professors Awi Federgruen and Costis Maglaras.
Master of Philosophy, Columbia University, Graduate School of Business, New York.
Diplom-Kaufmann (Diploma in Business), University of Hamburg.
Best paper award of the POMS 26th Annual Conference for the Humanitarian Operations and Crisis Management track (2015)
Joern Meissner received the best paper award of the POMS 26th Annual Conference for the Humanitarian Operations and Crisis Management track for her article (together with Maria Besiou and Laura Turrini) "Understanding Fundraising in Humanitarian Supply Chains".