Assignment 8
Assignment 8
Q1. There are two jobs job 1 and job 2. They are to be processed on two machines, machine A
and Machine B in the order AB. Job 1 takes 2 hours on machine A and 3 hours on machine B.
Job 2 takes 3 hours on machine A and 4 hours on machine B. Find the optimal sequence which
minimizes the total elapsed time by using Gantt chart.
Q2. There are five jobs, which are to be processed on two machines A and B in the order AB.
The processing times in hours for the jobs are given below. Find the optimal sequence and
total elapsed time.
Q3. A manufacturing company processes 6 different jobs on two machines A and B in the
order AB. Number of units of each job and its processing times in minutes on A and B are
given below. Find the optimal sequence and total elapsed time and idle time for each
machine.
Q4. A machine operator has to perform three operations, namely plane turning, step turning
and taper turning on a number of different jobs. The time required to perform these
operations in minutes for each operating for each job is given in the matrix given below. Find
the optimal sequence, which minimizes the time required.
Q5. A ready-made dress company is manufacturing its 7 products through two stages i.e.
cutting and Sewing. The time taken by the products in the cutting and sewing process in
hours is given below:
(a) Find the optimal sequence that minimizes the total elapsed time.
(b) Suppose a third stage of production is added, namely Pressing and Packing, with
processing time for these items as given below:
Find the optimal sequence that minimizes the total elapsed time considering all the three
stages.
Q6. There are 4 jobs A, B, C and D, which is to be, processed on machines M1, M2, M3 and M4
in the order M1 M2 M3 M4 .The processing time in hours is given below. Find the optimal
sequence.
Q7. In a maintenance shop mechanics has to reassemble the machine parts after yearly
maintenance in the order PQRST on four machines A, B, C and D. The time required to
assemble in hours is given in the matrix below. Find the optimal sequence.