Maria Rieders

Maria Rieders
  • Adjunct Professor
  • Faculty Fellow, Undergraduate Advisor

Contact Information

  • office Address:

    3730 Walnut Street
    517 Jon M. Huntsman Hall
    Philadelphia, PA 19104


Maria Rieders earned a M.Sc. degree in applied mathematics from the University of Ulm, Germany in 1984 and a M.Sc. and a Ph.D. in business administration from the University of Rochester in 1987 and 1990, respectively.

Maria Rieders is an adjunct full professor of Operations, Information and Decisions at the Wharton School of the University of Pennsylvania. She has extensive experience teaching engineering and business students at the undergraduate and graduate level and has been awarded several teaching awards while on the faculty at Northwestern University. At Wharton, she has been teaching Ph.D. level courses in the areas of stochastic models, queueing theory, and dynamic programming since 2001.

Her research interests focus on stochastic models, in particular on computational methods for large-scale systems, with applications in the performance analysis of communication systems and production facilities Her research has been funded by the National Science Foundation, by Ameritech Corporation, and, through collaboration with students, by Motorola and Argonne National Laboratory.

Previous employments include a scientific staff position at the Allensbach Institute for Public Opinion Research in Allensbach, Germany (1984-1985), a faculty position at the Department of Industrial Engineering and Management Sciences at Northwestern University (1990-1995), a visiting researcher post at the Institute for Operations Research at the Universität Bonn, Bonn, Germany (1993) and industrial consulting engagements.

Continue Reading


Past Courses


    The Senior Capstone Project is required for all BAS degree students, in lieu of the senior design course. The Capstone Project provides an opportunity for the student to apply the theoretical ideas and tools learned from other courses. The project is usually applied, rather than theoretical, exercise, and should focus on a real world problem related to the career goals of the student. The one-semester project may be completed in either the fall or sprong term of the senior year, and must be done under the supervision of a sponsoring faculty member. To register for this course, the student must submit a detailed proposal, signed by the supervising professor, and the student's faculty advisor, to the Office of Academic Programs two weeks prior to the start of the term.


    This course introduces basic concepts of operations management and application of the same in business practice today. We will examine the theoretical foundations of operations management and how these principles or models can be employed in both tactical and strategic decision making. Topics covered in detail are forecasting techniques, planning under deterministic and uncertain demand, operations planning and scheduling, queuing theory, service operations management, newsvendor models, risk pooling strategies in firms, capacity and revenue management, and supply chain coordination. We will conclude by discussing how supply chains evolve under technological change.


    This course introduces mathematical models describing and analyzing the behavior of processes that exhibit random components. The theory of stochastic processes will be developed based on elementary probability theory and calculus. Topics include random walks, Poisson processes, Markov chains in discrete and continuous time, renewal theory, and martingales. Applications from the areas of inventory, production, finance, queueing and communication systems will be presented throughout the course.


    Extension of the material presented in OIDD930 to include renewal theory, martingales, and Brownian motion.


    This course presents the mathematical foundations for the analysis of queueing systems. We will study general results like Little's law and the PASTA property. We will analyze standard queueing systems (Markovian systems and variations thereof) and simple queueing networks, investigate infinite server models and many server approximations, study GI/G/1 queues through random walk approximations, and read papers on applied queueing models.


    The course goal is to provide a brief but fairly rigorous introduction to the formulation and solution of dynamic programs. Its focus is primarily methodological. We will cover discrete state space problems, over finite or infinite time horizon, with and without discounting. Structured policies and their theoretical foundation will be of particular interest. Computational methods and approximation methods will be addressed. Applications are presented throughout the course, such as inventory policies, production control, financial decisions, and scheduling.


The Post-COVID Workplace: Will Employees Be Safe?

The transition back to a physical workplace promises to come with perils both real and perceived, as well as new kinds of tensions, Wharton experts say.

Knowledge @ Wharton - 2020/07/7
What Poker Can Teach Us about Making the World a Better Place

Wharton’s Katherine Milkman talks with psychologist Maria Konnikova about her new book, ‘The Biggest Bluff,’ and how we can make decisions in an environment in which we have very little control.

Knowledge @ Wharton - 2020/07/2
How CFOs Can Be Better Leaders in the Age of COVID-19

The quality of their relationships will be the differentiating factor for CFO success, write Catherine Dixon and her co-authors in this opinion piece.

Knowledge @ Wharton - 2020/07/2