Home > Operation Research calculators > Sequencing Problems example

Sequencing Problems example ( Enter your problem)
  1. Introduction
  2. Johnson's algorithm for optimal sequence
  3. Example-1
  4. Example-2
  5. Example-3
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

2. Johnson's algorithm for optimal sequence
(Previous example)
4. Example-2
(Next example)

3. Example-1





1. A book binder has one printing press, one binding machine and manuscripts of 7 different books. The times required for performing printing and binding operations for different books are shown below.
Book1234567
Printing time (hours)209080201201565
Binding time (hours)25607530903550
Decide the optimum sequence of processing of books in order to minimize the total time required to bring out all the books.

Solution:
Job1234567
Machine `M_1`209080201201565
Machine `M_2`25607530903550


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

2. The next smallest processing time is 20 hour for job 1,4 on Machine-1 and for this jobs 30 is largest on Machine-2. So job 4 will be processed after job 6.
64

3. The next smallest processing time is 20 hour for job 1 on Machine-1. So job 1 will be processed after job 4.
641

4. The next smallest processing time is 50 hour for job 7 on Machine-2. So job 7 will be processed last.
6417

5. The next smallest processing time is 60 hour for job 2 on Machine-2. So job 2 will be processed before job 7.
64127

6. The next smallest processing time is 75 hour for job 3 on Machine-2. So job 3 will be processed before job 2.
641327

7. The next smallest processing time is 90 hour for job 5 on Machine-2. So job 5 will be processed before job 3.
6415327


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


Job`M_1`
In time
`M_1`
Out time
`M_2`
In time
`M_2`
Out time
Idle time
`M_2`
600 + 15 = 151515 + 35 = 5015
41515 + 20 = 355050 + 30 = 80-
13535 + 20 = 558080 + 25 = 105-
55555 + 120 = 175175175 + 90 = 26570
3175175 + 80 = 255265265 + 75 = 340-
2255255 + 90 = 345345345 + 60 = 4055
7345345 + 65 = 410410410 + 50 = 4605


The total minimum elapsed time = 460

Idle time for Machine-1
`=460 - 410`

`=50`


Idle time for Machine-2
`=(15)+(175-105)+(345-340)+(410-405)+(460-460)`

`=15+70+5+5+0`

`=95`


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



2. Johnson's algorithm for optimal sequence
(Previous example)
4. Example-2
(Next example)





Share this solution or page with your friends.


 
Copyright © 2023. All rights reserved. Terms, Privacy
 
 

.