Scribd
Upload
74 views4 pages

Aamm Assignment 1

The document contains 4 assignments related to linear programming and job shop scheduling problems. 1) The first assignment involves minimizing a linear objective function subject to 3 constraints and finding the optimal solution. 2) The second assignment formulates an optimization problem to maximize revenue subject to 4 constraints and identifies the corner point solution. 3) The third assignment applies Johnson's algorithm to schedule 6 jobs on 3 machines and finds the optimal sequence. 4) The fourth assignment models a job shop scheduling problem as a 3-machine flowshop problem, applies Johnson's algorithm, and calculates the minimum total elapsed time and idle times for each machine.

Uploaded by

nanditha sivan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
74 views4 pages

Aamm Assignment 1

The document contains 4 assignments related to linear programming and job shop scheduling problems. 1) The first assignment involves minimizing a linear objective function subject to 3 constraints and finding the optimal solution. 2) The second assignment formulates an optimization problem to maximize revenue subject to 4 constraints and identifies the corner point solution. 3) The third assignment applies Johnson's algorithm to schedule 6 jobs on 3 machines and finds the optimal sequence. 4) The fourth assignment models a job shop scheduling problem as a 3-machine flowshop problem, applies Johnson's algorithm, and calculates the minimum total elapsed time and idle times for each machine.

Uploaded by

nanditha sivan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

ASSIGNMENT 1

Submitted by:Nanditha Sivan


BFT Sem 7

1. Minimize Z = 20 X1 + 40 X2

36X1 + 6X2 ≥ 108


3X1 + 12X2 ≥ 36
20X1 + 10X2 ≥ 100
X1≥0, X2≥0
6X1+X2>=18—---(3.0)(0,18)
X1+4X2>=12—---(12,0),(0,3)
2X1+X2>=10—---(5,0)(0,10)

A=> (12,0) – 240


B=> (4,2) – 160
C=> (2,6) – 280
D=> (0,18) – 720

Ans . X1=4,X2=2 and Z= 160

2.
x: number of scientific calculators produced
y: number of graphing calculators produced
Negative number of calculators can not be produced therefore
the two constraints are x > 0 and y > 0.
But in this case, constraints can be neglected as we have x > 100 and y > 80.
Also from the given data we can conclude that x < 200 and y < 170.
The minimum shipping requirement is x + y > 200.
The revenue relation will be the optimization
equation: R = -2x + 5y. So the entire system is:

R = -2x + 5y, subject to:


100 < x < 200
80 < y < 170
x + y > 200

A(100,170),B(200,170),C(200,80),D(120,80) and
E(100,100) are the corner points.
While testing the corner points at A(100, 170),
B(200, 170), C(200, 80), D(120, 80), and E(100,
100), the maximum value of R = 650 is obtained at (x, y) = A(100, 170).

Therefore, the solution is "100 scientific calculators and 170 graphing calculators".

3.

Jobs Processing Time (in hours)


Machine A Machine B Machine C
1 8 3 8
2 3 4 7
3 7 5 6
4 2 2 9
5 5 1 10
6 1 6 9

Min Ai=1;Max Bi=6 Min C1=6.


So the condition Max Bi<=Min Ci is satisfied.
Now ,we consider two fictitious machines G and H with corresponding processing times Gi =
Ai+ Bi and Hi = Bi + Ci, where Gi and Hi are the processing times for the ith job on machine G
and machine H, respectively. The processing times for the new problem are given below:

JOB Gi=Ai+Bi Hi=Bi+Ci

1 11 11

2 7 11

3 12 11

4 4 11

5 6 11

6 7 15

Following the Johnson’s algorithm, the optimal sequence which would minimize the
processing time is:

4 5 2 6 1 3
Or
4 5 6 2 1 3

4.

Task A B C D E F G
Time on

Machine 1 3 8 7 4 9 8 7

Machine 2 4 3 2 5 1 4 3

Machine 3 6 7 5 11 5 6 12

Task Machine 1(M1) Machine 2(M2) Machine 3(M3)

A 3 4 6

B 8 3 7

C 7 2 5

D 4 5 11

E 9 1 5

F 8 4 6

G 7 3 12

MIN M1=3; MAX M2= 5; MIN M3=5


MAX M2=MIN M3
Gi=M1i+M2i ;Hi=M2i+M3i

Task Gi Hi

A 7 10

B 11 10

C 9 7

D 9 16
E 10 6

F 12 10

G 10 15

OPTIMAL SEQUENCES:

A D G F B C E

or A D G B F C E

The minimum total elapsed time in completing the tasks =

Task Machine1 Machine 2 Machine 3

In Out In Out In Out

A 0 3 3 7 7 13

D 3 7 10 17 13 24

G 7 14 14 19 24 36

F 14 22 21 24 36 43

B 22 30 29 37 43 49

C 30 37 37 40 49 54

E 37 46 46 47 54 59

The elapsed time was 59 hours


The idle time for various machines is as follows:
Machine 1: 59-46 = 13 hours
Machine 2: 3+(10-7)+(14-17)+(21-19)+(29-24)+(37-37)+(46-40)+(59-47)= 28 hours
Machine 3: 7 hours

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy