Scribd
Upload
228 views2 pages

Type 1: N Jobs × 2 Machine Problems: Sequencing

The document describes a sequencing problem involving 6 jobs that must be processed on two machines (A and B) in the order AB. It provides the processing times for each job on each machine. The optimal sequence is determined to be 1, 5, 4, 2, 6, 3 by minimizing processing times on each machine. This sequence is used to calculate the elapsed time as 35 hours and idle times of 9 hours for Machine A and 2 hours for Machine B.

Uploaded by

Karthick S Mech KIOT
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
228 views2 pages

Type 1: N Jobs × 2 Machine Problems: Sequencing

The document describes a sequencing problem involving 6 jobs that must be processed on two machines (A and B) in the order AB. It provides the processing times for each job on each machine. The optimal sequence is determined to be 1, 5, 4, 2, 6, 3 by minimizing processing times on each machine. This sequence is used to calculate the elapsed time as 35 hours and idle times of 9 hours for Machine A and 2 hours for Machine B.

Uploaded by

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

Dr.N.

Panneerselvam, ASP, MECH, KIOT,O R Material - 01

OPERATIONS RESEARCH
Workbook

SEQUENCING

1. n jobs × 2 machine problems


2. n jobs × 3 machine problems

Type 1: n jobs × 2 machine problems


PROBLEM 1:

There are six jobs, each of which must go through two machines A and B in the
order AB. Processing time in hours is given in table.

Processing time
Job Machine Machine
A B Determine the sequence for
1 2 3 a the six jobs which will
2 5 6 e
minimize the elapse time and
3 6 4 d
4 3 7 c idle time.
5 2 5 b
6 8 8 f

SOLUTION:
Step 1: To find the optimal sequence.

Processing time
Job
Machine A Machine B
1 2 3
2 5 6
3 6 4
4 3 7
5 2 5
6 8 8

Display (ie.: Optimal sequence)


1 5 4 2 6 3
Min processing time on machine A Min processing time on machine B
Dr.N.Panneerselvam, ASP, MECH, KIOT,O R Material - 01

Step 2: To calculate elapse time:


Order of processing – AB

Optimal Machine A Machine B


sequence Time in Time out Time in Time out
1 0 0+2=2 2 2+3=5
5 2 2+2=4 5 5+5=10
4 4 4+3=7 10 10+7=17
2 7 7+5=12 17 17+6=23
6 12 12+8=20 23 23+8=31
31+4=
3 20 20+6=26 31
35

Elapse time

Step 3: To calculate idle time

Idle time on Machine A = 35 – 26 = 9hrs

Idle time on Machine B = 2 hrs.

You might also like