WN09-syllabusG

Embed Size (px)

Citation preview

  • 8/11/2019 WN09-syllabusG

    1/4

  • 8/11/2019 WN09-syllabusG

    2/4

    BUS M&L 881 Winter '09 Schedule

    Date Lecture Subject Readings Due

    Jan 5 Course Overview and Intro to Forecasting

    Jan 7 Intro to Time Series Approaches

    Jan 12 Dealing with Trend & Seasonality

    Jan 14 Forecasting

    Forecasting in Practice / Demand Management #1, #2

    Jan 19 MLK Day Holiday

    Jan 21 Modeling Solution Methods - Heuristics, Optimization & Simulation #3, #4, #5Project

    #1

    Jan 26 Optimization: Formulating and Solving Integer Programs

    Jan 28Introto

    Modeling

    Simulation: Concepts and Software (Demo)

    Feb 2 EXAM 1 1:30-3:18 PM @ 305 GERLACH

    Feb 4 Building Blocks

    Feb 9 Vehicle Routing (issues, using the sweep and savings methods)

    Feb 11 Routing&

    Scheduling

    Guest Lecture Topic TBAProject

    #2

    Feb 16 Facility Location (issues, grid methods, median problem)

    Feb 18 The Next Step: Intro to Network Design

    Feb 21 Guest Lecture from Logictools (To be confirmed)Project

    #3

    Feb 25 Lab @ Mason 345

    Feb 27 Lab @ Mason 345

    Mar 2 Open Lab @ Mason 345, 3:30-5:30 PM

    Mar 4

    NetworkModeling

    Lab @ Mason 345 #6, #7, #8

    Mar 9 Discuss Readings Project#4

    Mar 11 Course Review

    Mar 16 FINAL EXAM TBA

    # Required Readings (see list on p. 3)

  • 8/11/2019 WN09-syllabusG

    3/4

    BUS M&L 881 Course Readings

    Forecasting #1 Demand Forecasting: Reality vs. Theory Steve Robeano

    #2 The Demand Management Process Croxton, Lambeand Rogers

    Intro toModeling

    #3 Heuristics: Rules of Thumb for Logistics Decision Making Ballou

    #4 Simulation in Logistics: A Review of Present Practice and a Look to theFuture

    Bowersox & Clo

    #5 Optimization Models for Logistics Decisions Powers

    NetworkModeling

    #6 Designing an Integrated Distribution System at DowBrands, Inc. Robinson, GaoMuggenborg

    #7 Strategic Service Network Design for DHL Hong Kong Cheung, Leung

    #8 Global Supply Chain Management at Digital Equipment Corporation Arntzen et al

    Note: JBL is the Journal of Business Logistics

    All articles (except #1, #2) can be found in the library or on-line. To find them on-line, go to the course wehttp://carmen.osu.edu. If you choose to access the articles through Business Source Complete go to http

    click on "Research Databases", go to "B" and click on "Business Source Premier." From there you can cocombination of the author, the article title, or the journal title. Once you find the article, you should be abledownload the article in PDF format.

  • 8/11/2019 WN09-syllabusG

    4/4

    BUS M&L 881 Optional Readings(On reserve in the Business Library)

    Makridakis, Spyros G.; Wheelwright, Steven C.; and, Hyndman, Rob J. (1998), Forecasting Methods andApplications, 3

    rded., John Wiley and Sons: New York, NY.

    1. Chapter 2 Section 2/4: Measuring Forecast Error Section 2/5: Prediction Intervals Section 2/6: Least Square Estimates Section 2/7 : Transformations and Adjustments Appendix 2-A: Notation for Quantitative Forecasting Appendix 2-B: Summation Sign some rules.

    2. Chapter 4 Exponential smoothing methods

    Section 4/1: The Forecasting Scenario Section 4/2: Averaging Methods Section 4/3: Exponential Smoothing Section 4/4: A Comparison of Methods Section 4/5: General Aspects of Smoothing Methods

    Ballou, Ronald H. (1992),Business Logistics Management, 3rd

    ed., Prentice Hall Inc.: NJ.

    3. Classic Time-Series Decomposition (pp. 125-130)

    Lawrence, John A. Jr.; Pasternack, Barry A. (1998),Applied Management Science A Computer-Integrated

    Approach for Decision Making, John Wiley and Sons: New York, NY.4. Chapter 9: Forecasting

    5. Chapter 3: Linear Programming

    6. Chapter 4: Linear Programming Applications

    7. Chapter 5: Integer Linear Programming

    8. Chapter 6: Network Models Section 6.4: The Traveling Salesman Problem Section 6.5: The Shortest Path Problem Section 6.6: The Minimal Spanning Tree Problem