Logistics Operations
Sections:
1. Introduction to Logistics
2. Transportation Operations
3. Material Handling
4. Analysis of Material Handling Operations
Four Categories of Workers
1. Logistics workers
Move things
Human components of logistics system
L
IE 250
Operations Analysis and Design
Lecture 2: Manual Work and
WorkerMachine Systems
Instructor: Yasin Ggn, Ph.D.
1
Work Systems
Work systems can be classified into three
basic categories:
1. Manual work systems
2. Workermachine systems
3. Automated
Work Flow and Batch Processing
Sections:
1. Sequential Operations and Work Flow
2. Batch Processing
3. Defects in Sequential Operations and
Batch Processing
4. Work Cells
Some Definitions
Sequential operations
series of separate processing steps that are
IE 250
HW1
Due October 16th, 2015, 5 P.M.
4 problems from the textbook:
Q1) Problem 2.5 from the textbook.
Q2) Problem 2.11 from the textbook.
Q3) Problem 3.12 from the textbook.
Q4) Problem 4.19 from the textbook.
IE 250
Operations Analysis and Design
Lecture 1: Introduction
Instructor: Yasin Ggn, Ph.D.
1
Introduction
In this course, we will primarily focus on work.
We will examine the principles and programs that
allow work to be performed most efficiently and
s
Starting Methods
Special structure of Canonical Tableau enables Simplex to proceed smoothly.
When all constrains are of type (and the constraint vector is nonnegative), an initial Canonical Tableau is
immediately available: in Standard Form, Slack Variabl
Optimization Models and Linear Programming
Linear Programming (L.P.) is a mathematical modeling technique that typically deals with the problem of allocating limited resources
among competing activities in the best possible (i.e. optimal) way.
The variety
Duality in Linear Programming
Every L.P. problem has a related L.P. problem called the Dual Problem. Original problem (Primal Problem),
and its dual have their parameters, formulations, solutions and objective function values related to one another.
The r
What is Operations Research?
Various Definitions

Analyzing the problem of allocating available resources to various activities in an organization in a way which is
most effective for the organization as a whole.

Analyzing the problem of increasing the
Generation of an Initial Dual Feasible Basis
The Dual Simplex Algorithm presented assumes that an initial dual feasible basis is available (in the example
problems initial dual feasible basis were provided). However, there are many cases where the initial
24/09/14
IE 413
Supply Chain Management
INTRODUCTION
Taner Bilgi
Department of Industrial Engineering
Boazii University
Functional Areas of the Firm
Operations
Marketing
Taner Bilgi
Boazii University
Finance
IE413 Supply Chain
Management
1
1
24/09/14
Stra
11/24/12
IE 413 Supply Chain Management
Supply Contracts
Taner Bilgi
Department of Industrial Engineering
Boazii University
Outline
We will consider the situation where a
supplier is selling to the newsvendor
There is inefficiency in the supply chain wh
25/11/14
IE 413 Supply Chain Management
Scheduling: Introduction
Taner Bilgi
Department of Industrial Engineering
Boazii University
Short range
Mid range
Long range
CRP & MPC
Resource
Planning
Sales and operations
Planning
Roughcut
capacity planning
Mast
11/6/14
IE 413 Supply Chain Management
Capacity Planning
Taner Bilgi
Department of Industrial Engineering
Boazii University
The Production Equation
Demand
Material
Requirement
Materials
Suppliers
Customer
Work Load
+
Value
added
=
Product
Capacity
Materia
03.11.2009
IE 413 Supply Chain Management
Deterministic Inventory Models
Taner Bilgi
Department of Industrial Engineering
Boazii University
Inventory Investment
Survey of Current Business (2003), FY03 Q3:
Total U.S. investment in inventories = $1.41 tril
07.11.2010
IE 413 Supply Chain Management
Probabilistic Inventory Models
Taner Bilgi
Department of Industrial Engineering
Boazii University
Outline
Inventory management for end items
(independent demand)
Inventorytime graph
Random demand, single perio
IE 413 Supply Chain Management
JustinTime Production
Taner Bilgi
Department of Industrial Engineering
Boazii University
Operating an MRP System
Should MRP carry safety stock?
y
How much safety stock should be carried?
Issue of safety lead time
Danger of
IE 413 Supply Chain Management
Materials Requirement Planning
Taner Bilgi
Department of Industrial Engineering
Boazii University
The Production Equation
Demand
Material
Requirement
Materials
Suppliers
Customer
Work Load
+
Value
added
=
Product
Capacity
Ma
01.10.2009
IE 413 Supply Chain Management
AGGREGATE PLANNING
(Sales & Operations Planning)
Taner Bilgi
Department of Industrial Engineering
Boazii University
Overview
Long Range
(years)
Medium Range
(618 months)
Short Range
(several weeks to
months)
Tane
11.10.2009
IE 413 Supply Chain Management
Master Production Scheduling
Taner Bilgi
Department of Industrial Engineering
Boazii University
Manufacturing Planning & Control
Resource
Planning
Sales and operations
Planning
Master Production
Scheduling
Detaile
Aggregate Production Planning: Math
Programming Approaches
Taner Bilgic
taner@boun.edu.tr
Bogazici University
Department of Industrial Engineering
Bebek 34342 Istanbul TURKEY
Taner Bilgic Bogazici University IE413 SCM p. 1/23
Outline
Mathematical prog
Aggregate Production Planning:
Disaggregation
Taner Bilgi
Bogazii University
Department of Industrial Engineering
Bebek 34342 Istanbul TURKEY
October 12, 2009
Taner Bilgi
Disaggregation
Disaggregation
Aggregate production plans should be disaggregated
A m
IE 413
Supply Chain Management
Fall 2014
Instructor
Assistant
Course schedule
Taner Bilgi, taner@boun.edu.tr
TBA
MTTThTh
45612 M 3120 M 3100 M 3100 M 2230 M 2230
Course web page http:/mo
Tnaz Ekim Kbra Tannm
05.05.2015
IE 202 PS 11
1.
Use branchandbound method to solve the following problem. Solve the subproblems graphically.
min z = 2x1 + 3x2
st.
x1 + x2 3
x1 + 3x2 6
x1, x20 and integer
2.
The Telfa Corporation manufactures tables and
Tnaz Ekim Kbra Tannm
24.02.2015
IE 202 PS 2
1.
Use the simplex algorithm to nd the optimal solution to the following LP:
min z= 4x1  x2
s.t.
2x1 + x2 8
x2 5
x1  x2 4
x1 0, x2 0
2.
Find the optimal solution to the following LP:
max z= 5x1 +3 x2
s.t.
4x1
Tnaz Ekim Kbra Tannm
07.04.2015
IE 202 PS 8
1.
Consider a transportation problem with following parameters.
15
35
25
10
50
40
The Cost Matrix, C:[
115 135 125
The Demand Vector, b: [30, 30, 30, 20]
110 150 140
Find an initial solution to the problem by NW
Tnaz Ekim Kbra Tannm
28.04.2015
IE 202 PS 10
1.
At the beginning of year 1, a new machine must be purchased. The cost of maintaining a machine i
years old is given in Table 1. The cost of purchasing a machine at the beginning of each year is given in
Tabl
Tnaz Ekim Kbra Tannm
14.04.2015
IE 202 PS 9
1.
Five employees are available to perform four jobs. The time it takes each person to perform each
job is given in the table below. Determine the assignment of employees to jobs that minimizes the total
time re
Tnaz Ekim Kbra Tannm
31.03.2015
IE 202 PS 7
1.
Steelco manufactures three types of steel at different plants. The time required to manufacture 1
ton of steel (regardless of type) and the costs at each plant are shown in Table. Each week, 100 tons of each