Scribd
Upload
54 views

Assignment - 4

This document contains 6 questions related to sequencing problems in operations research. It provides processing time details for multiple jobs that need to be sequenced across 2-3 machines to minimize the total elapsed time. The key assumptions in sequencing problems are discussed along with the "no passing rule". Specific sequencing problems are provided for 6 jobs across 2 machines, 4 jobs across 2 departments, 6 jobs across 3 machines, 9 jobs across 2 machines in sequence, and modifying Johnson's method for 3 machines.

Uploaded by

ranjeet singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
54 views

Assignment - 4

This document contains 6 questions related to sequencing problems in operations research. It provides processing time details for multiple jobs that need to be sequenced across 2-3 machines to minimize the total elapsed time. The key assumptions in sequencing problems are discussed along with the "no passing rule". Specific sequencing problems are provided for 6 jobs across 2 machines, 4 jobs across 2 departments, 6 jobs across 3 machines, 9 jobs across 2 machines in sequence, and modifying Johnson's method for 3 machines.

Uploaded by

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

HARCOURT BUTLER TECHNICAL UNIVERSITY, KANPUR

ASSSIGNMENT -4 OPERATIONS RESEARCH /BMA-351


III -B.Tech. - CE / 2022-23

1. Explain the principal assumptions made while dealing with sequencing problems. What is "no
passing rule" in a sequencing algorithm?
Six jobs are to be processed on two machines A and then on machine B. Time in hours taken by each
job on each machine is given below:

Jobs → 1 2 3 4 5 6

Machine A 5 3 2 10 12 6
Machine B 3 2 5 11 10 7
Determine the optimum sequence of jobs that minimizes the total elapsed time to complete the jobs.
Also compute the minimum time.

2. A company has four jobs on hand. Each of these must be processed in two departments, the
sequential order is A→B
Job-1 Job-2 Job-3 Job-4
Department: A(days) 8 6 5 2
Department: B(days) 8 3 4 5
Find the sequence in which 4 jobs should be processed so as to take minimum time to finish all
the 4 jobs.

3. Write a short note on the sequencing decision problem for n jobs on two machines.
Determine the optimal sequence of jobs that minimizes the total elapsed time and the
total elapsed time based on the following information:

Job→ 1 2 3 4 5 6
Machines
M1 3 12 5 2 9 11
M2 8 6 4 6 3 1
M3 13 14 9 12 8 13

4. A company has 6 jobs which go through 3 machines X, Y, Z in the order XYZ. The
processing time in minutes for each job on each machine is as follows,
Job M/C X M/C Y M/C Z
1 18 7 19
2 12 12 12
3 29 11 23
4 36 2 47
5 43 6 28
6 37 12 36
What should be the sequence of jobs such that the total make span is minimized?

5. We have 9 jobs, each of which must be processed on two machines I and II in the order
I→II. Processing times in hours are given in the below,
Jobs→
A B C D E F G H I
m/c I 4 7 6 11 8 10 9 7 6
m/c 8 10 9 6 5 11 5 10 13
II
Determine the sequence for the jobs that will minimize the total elapsed time.

6. Give Johnson's method for determining an optimal sequence for processing. Also modify
Johnson's method to solve the problem of processing n jobs through three machines.

You might also like