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

3. Example-3
(Previous example)
3. Processing n Jobs Through m Machines Problem
(Next method)

4. Example-4





Find solution of Processing 6 Jobs Through 3 Machines Problem
Job123456
Machine-1837251
Machine-2345216
Machine-38769109


Solution:
Job123456
Machine `M_1`837251
Machine `M_2`345216
Machine `M_3`8769109


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
11712467

Machine-H
111111111115


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

2. The next smallest processing time is 6 hour for job 5 on Machine-G. So job 5 will be processed after job 4.
45

3. The next smallest processing time is 7 hour for job 2,6 on Machine-G and for this jobs 15 is largest on Machine-H. So job 6 will be processed after job 5.
456

4. The next smallest processing time is 7 hour for job 2 on Machine-G. So job 2 will be processed after job 6.
4562

5. The next smallest processing time is 11 hour for job 1 on Machine-G. So job 1 will be processed after job 2.
45621

6. The next smallest processing time is 11 hour for job 3 on Machine-H. So job 3 will be processed last.
456213


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


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`
400 + 2 = 222 + 2 = 444 + 9 = 1324
522 + 5 = 777 + 1 = 81313 + 10 = 233-
677 + 1 = 888 + 6 = 142323 + 9 = 32--
288 + 3 = 111414 + 4 = 183232 + 7 = 39--
11111 + 8 = 191919 + 3 = 223939 + 8 = 471-
31919 + 7 = 262626 + 5 = 314747 + 6 = 534-


The total minimum elapsed time = 53

Idle time for Machine-1
`=53 - 26`

`=27`


Idle time for Machine-2
`=(2)+(7-4)+(19-18)+(26-22)+(53-31)`

`=2+3+1+4+22`

`=32`


Idle time for Machine-3
`=(4)+(53-53)`

`=4+0`

`=4`


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



3. Example-3
(Previous example)
3. Processing n Jobs Through m Machines Problem
(Next method)





Share this solution or page with your friends.
 
 
Copyright © 2025. All rights reserved. Terms, Privacy
 
 

.