OR 641 MIDTERM
Due: 8am, Tuesday, Oct 18, 2011.
1. Attempt all problems. Show all work. Explicitly state any assumptions
you have made.
2. The problem weights are as given in the parentheses.
3. The exam is open book, open notes.
4. No discussion about th
Homework 4
Due: Next week @ 13:40
1. Suppose cfw_Xn , n 0 and cfw_Yn , n 0 are two independent DTMCs with state-space
S = cfw_0, 1, 2, . Prove or give a counterexample to the following statements:
(a) cfw_Xn + Yn , n 0 is a DTMC.
(b) cfw_(Xn , Yn ), n 0 i
Planning Demand and Supply
in a Supply Chain
Forecasting and Aggregate Planning
Chapters 8 and 9
1
utdallas.edu/~metin
Learning Objectives
Overview of forecasting
Forecast errors
Aggregate planning in the supply chain
Managing demand
Managing capacity
2
u
EM 502
OPERATIONS MANAGEMENT
PROJECT MANAGEMENT
Ismail Serdar Bakal
Middle East Technical University
METU (IE)
EM 502
Project Management
1 / 31
Definition of a Project
A temporary endeavor undertaken to create a unique product or
service
Initiated to achi
EM 502
OPERATIONS MANAGEMENT
FORECASTING
Ismail Serdar Bakal
Middle East Technical University
Ismail Serdar Bakal (METU)
EM 502
Forecasting
1 / 64
Forecasting
The art and science of predicting future events
Thomas Watson, Chairman of IBM, 1943
I think the
EM 502
OPERATIONS MANAGEMENT
INTRODUCTION
Ismail Serdar Bakal
Middle East Technical University
Ismail Serdar Bakal (METU)
EM 502
Introduction
1 / 29
General Information
Textbook
Operations Management by Heizer, Render and Munson,
Pearson, 12th Edition, 20
Example on Network Construction and Critical Path Calculations
A student must complete courses in calculus (2 terms), statistics (3 terms), linear
programming (1 term), nonlinear programming (1 term), and stochastic programming
(1 term) before he can grad
IE 561 - Fall 2015
Assignment 1
Due October 26 - 09:40
Please work alone and show all your work.
Late assignments will not be accepted.
1. Let X1 , X2 , . . . be independent and identically distributed random variables having
the distribution function F (
IE 561 - Fall 2015
Assignment 5
Due November 30 - 09:40
Please work alone and show all your work.
Late assignments will not be accepted.
1. Prove the following proposition:
Let cfw_N(t), t 0 be a Poisson Process with rate . Let A1 , A2 , . . . , An be dis
IE 561 - Fall 2015
Assignment 6
Due December 14 - 09:40
Please work alone and show all your work.
Late assignments will not be accepted.
1. Consider a production system that produces a single item per day. Whether or not a
particular item is defective dep
EM 502
OPERATIONS MANAGEMENT
PROJECT MANAGEMENT
Ismail Serdar Bakal
Middle East Technical University
METU (IE)
EM 502
Project Management
1 / 51
Definition of a Project
A temporary endeavor undertaken to create a unique product or
service
Initiated to achi
ISEN 601
Location Logistics
Dr. Gary M. Gaukler
Fall 2011
Setup of a Facility Location
Problem
Locate new facilities
Considering:
Interaction with existing facilities
Customer demands
Customer locations
Potential locations of new facilities
Capacit
Management
Science 461
Lecture 1b - Distance Metrics
September 9, 2008
2
Distance Metrics
Without distances, DM problems usually
arent DM problems at all
If not distances, then metrics based on
distance
Time
Dependencies
3
Location Problems
In large-sc
Production Planning & Scheduling
in Large Corporations
Dealing with the Problem Complexity
through Decomposition
Corporate Strategy
Aggregate Unit
Demand
Aggregate Planning
(Plan. Hor.: 1 year, Time Unit: 1 month)
Capacity and Aggregate Production Plans
E
Chapter 2
Heuristic Methods
Abstract Since the linear ordering problem is NP-hard, we cannot expect to be
able to solve practical problem instances of arbitrary size to optimality. Depending
on the size of an instance or depending on the available CPU tim
Ministry of Foreign Affairs, Singapore
Chartered Institute of Logistics & Transport Singapore
Executive Programme in Logistics and Distribution Management
Business Logistics Management
9 October 2008, 9am~5pm
Business Logistics Management
Trends and Str
Stochastic Facility Location with General
Long-Run Costs and Convex Short-Run Costs
Peter Sch
utz a , Leen Stougie b , Asgeir Tomasgard c,
a Department
of Industrial Economics and Technology Management, Norwegian
University of Science and Technology, 7491
Traveling Salesman
Problem
By Susan Ott for 252
Overview of Presentation
Brief review of
TSP
Examples of
simple Heuristics
Better than Brute
Force Algorithm
Traveling Salesman
Problem
Given a complete, weighted graph on n
nodes, find the least weight
Management
Science 461
Lecture 7 Routing (TSP)
October 28, 2008
Facility Location Models
Assumes
Shipments
are not combined
Each truck serves one client at a time
Shortest path between facility and client
Can we relax this assumption?
Combine
shipment
Planning Demand and Supply
in a Supply Chain
Forecasting and Aggregate Planning
Chapters 8 and 9
1
utdallas.edu/~metin
Learning Objectives
Overview of forecasting
Forecast errors
Aggregate planning in the supply chain
Managing demand
Managing capacity
2
u
Chapter 2
FACILITY LOCATION IN SUPPLY CHAIN
DESIGN
Mark S. Daskin
Lawrence V. Snyder
Rosemary T. Berger
Abstract
1.
In this chapter we outline the importance of facility location decisions
in supply chain design. We begin with a review of classical models
SC Design
Facility Location Models
utdallas.edu/~metin
1
Analytical Models for SC Design
Objective functions
Private sector deals with total costs: minimizes the sum of the distances to the customers
Customers 2-10
Customer 1
Public sector
locates
Privat
LESSON 8: AGGREGATE PLANNING
Outline
Aggregate Planning
Issues
Costs
Two Strategies
Chase Strategy
Level Strategy
Optimization
Aggregate Production Planning
Chapter 2 discusses forecasting. If the demand for a
product changes over time, we need to
IE 561 - Fall 2015
Assignment 4
Due November 16 - 09:40
Please work alone and show all your work.
Late assignments will not be accepted.
1. A machine works for an exponentially distributed time with rate and then fails. A
repair crew checks the machines a
IE 561 - Fall 2015
Assignment 2
Due November 2 - 09:40
Please work alone and show all your work.
Late assignments will not be accepted.
1. Suppose the joint density of X and Y is given by f (x, y) = 4y(x y)e(x+y) , 0 <
x < , 0 y x. Compute E[X|Y = y].
2.
OR641
FINAL
Due: Tuesday, Dec 13, 2011; 8:00am
Attempt all problems. Show all work. All problems carry equal weight.
The test is open books, open notes.
P1. Mr. Dilbert possesses r umbrellas, which he employs in going from
his home to oce and vice versa.
Operations Research
Instructor: Mohamed Omar
Lecture 5: Basic Feasible Solutions/Simplex Method
Math 187
Theorem 1 Let A be an m n matrix, rank(A)=m. Let
F = cfw_x Rn : Ax = b, x 0.
Then x is a basic feasible solution of cfw_x Rn : Ax = b, x 0 if and only
Operations Research
Instructor: Mohamed Omar
Handout : Simplex Method
Math 187
Assumptions: The LP problem is of the form
max
z = cT x
s.t.
Ax = b
x0
where A is an m n matrix, n m, rank(A)=m. A feasible basis B is known. We denote
the set cfw_1, 2, . . .
Operations Research
Instructor: Mohamed Omar
Lecture 7: Two-Phase Method
Math 187
Last Time
We discussed the detailed iterations of the Simplex Method.
http:/www.math.hmc.edu/ omar/math187/SimplexMethod.pdf
Issues with Simplex Method
1. (Pertinent) How do