Você está na página 1de 2

Sequencing Problems - Operation research calculator https://cbom.atozmath.com/CBOM/SeqProb.aspx?q1=1,2,3,4,5,6,7`7,8,6...

Hire us Support us
I want to sell my website www.AtoZmath.com with complete code

Home What's new College Algebra Games Feedback About us


Algebra Matrix & Vector Numerical Methods Statistical Methods Operation Research Word Problems Calculus Geometry Pre-Algebra

Translate this page Home > Operation Research calculators > Sequencing Problems calculator

Powered by Translate
Method and examples
What's new Sequencing Problems
1. Determinants using Sarrus Type your data, for seperator you can use space or tab
Rule on 23.10.19 for sample click random button
2. Determinants using properties
of determinants

3. Hyperbolic functions
implemented on 26.09.19
4. Five number summary
5. diagonally dominant matrix
6. diagonally dominant equation OR
Units
7. set builder notation (Code
Number of Jobs :
improved) on 19.09.19
8. stem and leaf plot Number of Machine :
Generate

9. Partial Fraction bug solved on Job


13.09.19 Machine-1
10. PERT and CPM Network Machine-2
diagram (improved) on 26.08.19 Machine-3
Machine-4
1. BCD Addition on 22.08.19
2. BCD Subtraction using 9's Find Random New
complement
3. BCD Subtraction using 10's Solution Help
complement
4. Excess 3 Addition Solution will be displayed step by step (In 2 parts)
5. Excess 3 Subtraction using 9's
complement Solution
Hide

6. Excess 3 Subtraction using


10's complement Find solution of Sequence Problem
Job 1 2 3 4 5 6 7
11. Conversion on 22.08.19
1. Decimal To BCD Machine-1 7 8 6 6 7 8 5
2. BCD To Decimal
3. Decimal To Excess 3 Machine-2 2 2 4 3 3 2 4
4. Excess 3 To Decimal
Machine-3 2 5 4 4 2 1 5
5. Decimal To Gray code
6. Gray code To Decimal Machine-4 8 4 4 2 5 4 5
12. Logarithmic equations
07.08.19
Solution:
Job 1 2 3 4 5 6 7
Topics Machine M 1 7 8 6 6 7 8 5
Home
Algebra Machine M 2 2 2 4 3 3 2 4
Matrix & Vector
Machine M 3 2 5 4 4 2 1 5
Numerical Methods
Statistical Methods Machine M 4 8 4 4 2 5 4 5
Operation Research
Word Problems
Calculus
Geometry
Since any of condition min {T1j} ≥ max {Tij} and/or min {Tmj } ≥ max {Tij }, for j=2,3,...,m-1 is satisfied.
Pre-Algebra So given problem can be converted to 2-machine problem.
College Algebra
Games Machine-1
Test 11 15 14 13 12 11 14

Machine-2
12 11 12 9 10 7 14

1. The smallest processing time is 7 hour for job 6 on Machine-2. So job 6 will be processed last.
2. The next smallest processing time is 9 hour for job 4 on Machine-2. So job 4 will be processed before job 6.
3. The next smallest processing time is 10 hour for job 5 on Machine-2. So job 5 will be processed before job 4.
We use cookies to improve your experience on our site and to show you relevant advertising. By browsing this website, you agree to our use of cookies. Learn more

1 of 2 12-12-2019, 14:20
Sequencing Problems - Operation research calculator https://cbom.atozmath.com/CBOM/SeqProb.aspx?q1=1,2,3,4,5,6,7`7,8,6...

5. The next smallest processing time is 11 hour for job 2 on Machine-2. So job 2 will be processed before job 5.
6. The next smallest processing time is 12 hour for job 3 on Machine-2. So job 3 will be processed before job 2.
7. The next smallest processing time is 14 hour for job 7 on Machine-1. So job 7 will be processed after job 1.

According to Johanson's algorithm, the optimal sequence is as below


1 7 3 2 5 4 6

M1 M1 M2 M2 M3 M3 M4 M4 Idle time Idle time Idle time


Job M2 M3 M4
In time Out time In time Out time In time Out time In time Out time
1 0 0+7=7 7 7+2=9 9 9 + 2 = 11 11 11 + 8 = 19 7 9 11
7 7 7 + 5 = 12 12 12 + 4 = 16 16 16 + 5 = 21 21 21 + 5 = 26 3 5 2
3 12 12 + 6 = 18 18 18 + 4 = 22 22 22 + 4 = 26 26 26 + 4 = 30 2 1 -
2 18 18 + 8 = 26 26 26 + 2 = 28 28 28 + 5 = 33 33 33 + 4 = 37 4 2 3
5 26 26 + 7 = 33 33 33 + 3 = 36 36 36 + 2 = 38 38 38 + 5 = 43 5 3 1
4 33 33 + 6 = 39 39 39 + 3 = 42 42 42 + 4 = 46 46 46 + 2 = 48 3 4 3
6 39 39 + 8 = 47 47 47 + 2 = 49 49 49 + 1 = 50 50 50 + 4 = 54 5 3 2

The total minimum elapsed time = 54

Idle time for Machine-1


= 54 - 47
=7

Idle time for Machine-2


= 7 + 3 + 2 + 4 + 5 + 3 + 5 + (54 - 49)
= 34

Idle time for Machine-3


= 9 + 5 + 1 + 2 + 3 + 4 + 3 + (54 - 50)
= 31

Idle time for Machine-4


= 11 + 2 + 3 + 1 + 3 + 2 + (54 - 54)
= 22
Hide

Solution provided by AtoZmath.com


Any wrong solution, solution improvement, feedback then Submit Here

Want to know about AtoZmath.com and me

Home What's new College Algebra Games Feedback About us

Copyright © 2019. All rights reserved. Terms, Privacy

We use cookies to improve your experience on our site and to show you relevant advertising. By browsing this website, you agree to our use of cookies. Learn more

2 of 2 12-12-2019, 14:20

Você também pode gostar