Operational Research II

1
Operational Research II

• By Dr. SW Poon

2
Line of Balance
3
(No Transcript)
4
(No Transcript)
5
(No Transcript)
6
(No Transcript)
7
Linear Optimization in Applications

• Formulation of a linear programming problem
• Solving a linear programming problem
• Graphical method

8
Examples on Simplex Method
9
(No Transcript)
10
(No Transcript)
11
(No Transcript)
12
(No Transcript)
13
(No Transcript)
14
Integer Programming Solution
15
(No Transcript)
16
(No Transcript)
17
(No Transcript)
18
(No Transcript)
19
(No Transcript)
20
(No Transcript)
21
Sequencing and simulation (R. Pilcher)
22
Sequencing and simulation

• Sequencing
• A number of jobs, two stations

23
(No Transcript)
24

• A number of jobs, three stations
• The minimum processing time at station 1 is
  greater than or equal to the maximum processing
  time at station 2
• The minimum processing time at Station 3 is
  greater than or equal to the maximum processing
  time at station 2

25
(No Transcript)
26
Two jobs, a number of stations
27
Shortest routes through networks

• Graphical analysis of shortest-path problems

28
(No Transcript)
29
Monte Carlo Simulation

• A Monte Carlo simulation is a dynamic model of a
  situation, which results in a picture of the
  likely operation of the subject being modeled
  over a period of time
• Example 16.4
• A site concrete mixer produces 1m3 of concrete
  at each mixing. During a large pour of concrete,
  a wet hopper is used in front of the mixer into
  which the mixed concrete is discharged prior to
  being loaded into trucks. The wet hopper has a
  maximum capacity of 3 m3. The cycle time from
  discharge to discharge in mixing 1m3 of concrete
  is studied and the frequency distribution shown
  in Table 16.6 results.

30
(No Transcript)
31
(No Transcript)
32
(No Transcript)
33
(No Transcript)
34
(No Transcript)