Home > Operation Research calculators > Sequencing Problems example

Sequencing Problems example ( Enter your problem)
  1. Example-1
  2. Example-2
  3. Example-3
  4. Example-4
Other related methods
  1. Processing n Jobs Through 2 Machines Problem
  2. Processing n Jobs Through 3 Machines Problem
  3. Processing n Jobs Through m Machines Problem
  4. Processing 2 Jobs Through m Machines Problem

1. Processing n Jobs Through 2 Machines Problem
(Previous method)
2. Example-2
(Next example)

1. Example-1





1. Find solution of Processing 5 Jobs Through 3 Machines Problem
Job12345
Machine-18106711
Machine-256234
Machine-349865


Solution:
Job12345
Machine `M_1`8106711
Machine `M_2`56234
Machine `M_3`49865


Since any of condition `min{T_(1j)} >= max{T_(ij)}` and/or `min{T_(mj)} >= max{T_(ij)}`, for j=2,3,...,m-1 is satisfied.

So given problem can be converted to 2-machine problem.

Machine-G
131681015

Machine-H
9151099


1. The smallest processing time is 8 hour for job 3 on Machine-G. So job 3 will be processed first.
3

2. The next smallest processing time is 9 hour for job 1,4,5 on Machine-H and for this jobs 10 is smallest on Machine-G. So job 4 will be processed last.
34

3. The next smallest processing time is 9 hour for job 1,5 on Machine-H and for this jobs 13 is smallest on Machine-G. So job 1 will be processed before job 4.
314

4. The next smallest processing time is 9 hour for job 5 on Machine-H. So job 5 will be processed before job 1.
3514

5. The next smallest processing time is 15 hour for job 2 on Machine-H. So job 2 will be processed before job 5.
32514


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


Job`M_1`
In time
`M_1`
Out time
`M_2`
In time
`M_2`
Out time
`M_3`
In time
`M_3`
Out time
Idle time
`M_2`
Idle time
`M_3`
300 + 6 = 666 + 2 = 888 + 8 = 1668
266 + 10 = 161616 + 6 = 222222 + 9 = 3186
51616 + 11 = 272727 + 4 = 313131 + 5 = 365-
12727 + 8 = 353535 + 5 = 404040 + 4 = 4444
43535 + 7 = 424242 + 3 = 454545 + 6 = 5121


The total minimum elapsed time = 51

Idle time for Machine-1
`=51 - 42`

`=9`


Idle time for Machine-2
`=(6)+(16-8)+(27-22)+(35-31)+(42-40)+(51-45)`

`=6+8+5+4+2+6`

`=31`


Idle time for Machine-3
`=(8)+(22-16)+(40-36)+(45-44)+(51-51)`

`=8+6+4+1+0`

`=19`


This material is intended as a summary. Use your textbook for detail explanation.
Any bug, improvement, feedback then Submit Here



1. Processing n Jobs Through 2 Machines Problem
(Previous method)
2. Example-2
(Next example)





Share this solution or page with your friends.


 
Copyright © 2024. All rights reserved. Terms, Privacy
 
 

.