IE 383
Assignment 4
Due Tuesday, Feb 11, 2014 before class
Note1: Please put your homework in the file with group number assigned to you.
Note2: please show your calculation method clearly. Keep two decimal points for all the
results. All graphs must be f
NAME (Printed): _Solution_ _,_ _ _ _
(Last)
(First)
IE 383HW #3
Spring 2016
Due: Feb. 2, 2016
Instructions for completing the homework assignment: Write your name on the top of each
page submitted for the assignment. Homework must be legible. SHOW ALL YOU
IE 383
Assignment 7
Due October 15, Wednesday in class
Problem 1
(Data are the same as in Assignment 6).
Year
Demands
1
8025
2
7200
3
7145
4
6775
5
6952
6
6542
7
6525
8
6120
Given the information above forecast the data for year 9, 10 and 11 by using:
a)
IE383
Assignment 7
Due Date: Wed, Oct 24, 2012 BEFORE class
Note: Please put on your name in the right upper corner of homework in the
following format:
Last Name
First Name
That is, write down your name in two lines. The first line is your last name (fam
NAME (Printed): _Solution_,_ _ _ _
(Last)
(First)
IE 383HW #6
Spring 2016
Due: Mar. 1, 2016
Instructions for completing the homework assignment: Write your name on the top of each
page submitted for the assignment. Homework must be legible. SHOW ALL YOUR
IE 336: Operations Research - Stochastic Models
Homework Set #4 Solutions Spring 2008
p 1. Let P= 3q 0 q 0 0 0 r + q be the transition matrix of a Markov chain 1
p q
(a) Determine transition diagram:
1
3q
2
r+q
3
1
2 (b) If q > p2 , is it possible that p
IE 336: Operations Research - Stochastic Models
Homework Set #3 Solutions Spring 2008
1. From HW#1 we know that fX (x) = 2ex 2e2x and fY (y ) = 2e2y For E(X): E (X ) = =
0
xfX (x) dx
x
x 2ex 2e2x dx 2xex dx
0 0
= = 2
2xe2x dx
ex (1)
2
(1x 1)
0
2
e2x (2
17-6
Assuming all jobs were released at the same time (rj = 0).
Breaking ties rule: select the job with the lower value of job code.
FCFS Dispatching Rule
Sequence:
Job
pj
dj
A
B
C
D
E
F
2
3
1
2
4
12
3
4
4
8
5
10
Jobs Measures
Job
Cj
Lj
Tj
Ej
Uj
A
B
C
D
E
NAME (Printed): _Solution_,_ _ _ _
(Last)
(First)
IE 383HW #4
Fall 2014
Due: Sep. 22, 2014
Instructions for completing the homework assignment: Write your name on the top of each
page submitted for the assignment. Homework must be legible. Show all your w
IE383
Assignment 7
Due Date: Wed, Oct 24, 2012 BEFORE class
Problem 1
The forecasted demands for the next 6 months are given below.
Month
Demand
Jan
Feb
March
April
May
Jun
12,000
14,000
13,000
15,000
12,000
18,000
Hiring
30
0
500
25
20
Working
Days
20
22
IE 336 Sep. 5, 2008
Handout #2 Due Sep. 12, 2008
Homework Set #1
1. Let B1 , B2 , . . . , Bn be a partition of the sample space of a random experiment. Using the axioms 1 3 show that
n
P (A) =
i=1
P (A|Bi )P (Bi )
where A is an event from the sample space
IE 383 Assignment 8 Due October 20, Monday BEFORE class
Product tree for GPS VV26. Demand for the next 12 months
Month Deman d 1 14 2 10 3 22 4 18 5 0 6 15 7 0 8 24 9 20 10 25 11 30 12 22
Beginning inventory and scheduled receipts
GPS VV26 Receiver sys Se
Win (.5) invest $2.8 million deposit Good (.6) deposit $1.8 million Good (.6) $2.4 million Bad (.4) $2.4 million $2.8 million $2.2 million $1.8 million $2.2 D4 million $2.4 million C5 million $2.4 invest (.6) Good deposit bad (.4) Good (.6) $700,000 Bad (
IE 383
Assignment 7 solution
Problem 1
Year
Demands
1
8025
2
7200
3
7145
4
6775
5
6952
6
6542
7
6525
8
6120
Given the information above forecast the data for year 9, 10 and 11 by using:
a) linear regression (exponential model)
b) exponential smoothing (ex
NAME (Printed): _Solution_,_ _ _ _
(Last)
(First)
IE 383HW #6
Fall 2014
Due: Oct. 15, 2014
Instructions for completing the homework assignment: Write your name on the top of each
page submitted for the assignment. Homework must be legible. Show all your w
NAME (Printed): _Solution_,_ _ _ _
(Last)
(First)
IE 383HW #3
Fall 2014
Due: Sep. 15, 2014
Instructions for completing the homework assignment: Write your name on the top of each
page submitted for the assignment. Homework must be legible. Show all your w
Problem 5
Assuming all jobs were released at the same time (rj = 0). Breaking ties rule: select the job with the lower value of job code. a) SPT Dispatching Rule Sequence:
Job pj dj D 3 18 B 6 12 A 8 10 E 12 22 C 15 20
Jobs Measures Job Cj Lj Tj Ej Uj D 3
IE 383 Assignment 3 solution Some steps are omitted, but you should show your steps in your homework solutions. Note: all questions in this assignment are discrete location decision-making problems
Problem 1 Table 1: Possible rooms with their respective c
NAME (Printed): _Solution_,_ _ _ _
(Last)
(First)
IE 383HW #5
Spring 2016
Due: Feb. 23, 2016
Instructions for completing the homework assignment: Write your name on the top of each
page submitted for the assignment. Homework must be legible. SHOW ALL YOUR
IE 383 Sample Final Exam
Login _XU96_ = ATTENTION! This is NOT a complete sample final exam. These questions are released to familiarize you with the question format that you will see in the final.
Fill in the Blanks 1.(10 points) In the following system,
Chapter 3: Production (Aggregate) Planning - Introduction
What is Production Planning? What are the decisions
involved?
What are we given to work with?
Question: What is the major uncertainty?
Machine
Hours
Capacity
Time
1
Production Planning - Introducti
Whenever appropriate, draw the cash flow diagram and use the compound interest
factors notation.
Arithmetic-Progression Series
1. A debt of L.E. X is incurred at t = 0 (purchase of land). It is agreed that payments
of L.E. 5000, L.E. 4000, L.E. 3000, and
IE 383
Assignment 13
Due on April 23, Tuesday, Spring 2013.
Note1: Please put on your name in the right upper corner of homework in the following format:
Last Name
First Name
That is, write down your name in two lines. The first line is your last name (fa
IE 383 2013 Spring
Assignment 7 solution
Problem 1
a)
Linear model
t
1
2
3
4
5
6
7
8
Sum
Y
8020
7200
7145
6775
6900
6542
6515
6080
55177
Y*t
8020
14400
21435
27100
34500
39252
45605
48640
238952
t^2
1
4
9
16
25
36
49
64
204
According to method of least sq
IE 383
Assignment 3 solution
Some steps are omitted, but you should show your steps in your homework
solutions.
Problem 1
a.) This is a minimax per trip problem that uses rectilinear distance.
Table : Other rooms with their respective coordinates
?
X
Y
Ro
IE383, 2013 Spring
Assignment 5 (Practice Solution)
Note: You don't have to submit this assignment.
Problem 1
A product is assembled through workstations 1, 2, 3 and 4 sequentially. The outputs
from workstation 4 become finished goods. The processing time
Assignment 4 Solution, 2013 Spring
Problem 1.
(a)
After plotting points on the graph, first, draw the blue lines (each one at 45 with x-coordinate
axis) to include every point with the smallest square and find every intersection of the four lines.
Then, t
NAME (Printed): _,_ _ _ _
(Last)
(First)
IE 383HW #4
Fall 2017
Due: Sep. 19, 2017
Instructions for completing the homework assignment: Write your name on the top of each
page submitted for the assignment. Homework must be legible. SHOW ALL YOUR WORK.
Home
NAME (Printed): _,_ _ _ _
(Last)
(First)
IE 383HW #3
Fall 2017
Due: Sep. 12, 2017
Instructions for completing the homework assignment: Write your name on the top of each
page submitted for the assignment. Homework must be legible. SHOW ALL YOUR WORK.
Home
NAME (Printed): _,_ _ _ _
(Last)
(First)
IE 383HW #5
Fall 2017
Due: Oct. 3, 2017
Instructions for completing the homework assignment: Write your name on the top of each
page submitted for the assignment. Homework must be legible. SHOW ALL YOUR WORK.
Homew
Esmaeil Bahalkeh, Linear Programming Project (on-campus)
Model 19: Personnel Scheduling
At the beginning of the fall semester, the director of the computer facility of a certain university
is confronted with the problem of assigning different working hour