A

PROJECT ON
“ SEQUENCING PROBLEM ”

Submitted By
AAFREEN IFTIKHAR ZAIDI
M.B.A (Semester -II)
Batch-2020-21

Submitted To:
Prof. SONIYA RAJPOOT

SAMRAT ASHOK TECHNOLOGICAL INSTITUTE (S.A.T.I.

COLLEGE)
YEAR- 2020-2021
 DECLARATION
I hereby declare that my Project Report entitled
“SEQUENCING PROBLEMS”
is an authentic work done by me as part of my study .

The Project was undertaken as a part of the course curriculum of MBA Full Time
Programme of Samrat Ashok Technological Institute (S.A.T.I. College), Vidisha.
This has not been submitted to any other examination body earlier.

Date:- 22.06.2021 Signature

Name: Aafreen Iftikhar Zaidi
MBA (Full Time) II Sem.
Samrat Ashok Technological Institute
(S.A.T.I. College)- Vidisha
 ACKNOWLEDGEMENT

I sincerely acknowledge with a deep heart felt gratitude to my Project In charge

PROF. SONIYA RAJPOOT for her valuable and faithful guidance, encouragement &
suggestions throughout the completion of the Project work.

I would like to extend my sincere thanks to PROF. (Dr) J.S.Chauhan, Director of

Samrat Ashok Technological Institute (S.A.T.I. College)- Vidisha (M.P.) for his
continuous support and guidance.

Last but not the least gratitude to all those who extended their guidance directly or
indirectly in completion of this Project work .

Aafreen Iftikhar Zaidi

MBA (Full Time)- II SEM.
 TABLE OF CONTENT

Sr. No. CHAPTERS PAGE No.

1 INTRODUCTION 05
2 CONCEPT OF FINANCE 06
3 DEFINITIONS OF FINANCE 07
4 TYPES OF FINANCE 08
5 DEFINITIONS OF FINANCIAL MANAGEMENT 09
6 AIMS OF FINANCIAL MANAGEMENT 10
7 OBJECTIVES OF FINANCIAL MANAGEMENT 12
8 CONCLUSION 14
9 BIBLIOGRAPHY 15
 INTRODUCTION

In this Project, we discuss the problem of determining the sequence (order) in which a
number of jobs should be performed on different machines in order to make effective use of
available facilities and achieve greater output. If there are n jobs which are to be performed
on m different machines then the problem is to determine the sequence of jobs, which
minimizes the total elapsed time, that is, the time from the start of the first job up to the
completion of the last job.

The selection of an appropriate order for finite number of different

jobs to be done on a finite number of machines is called sequencing
problem. In a sequencing problem we have to determine the optimal
order (sequence) of performing the jobs in such a way so that the total
time (cost) is minimized.

Suppose that 2 or 3 jobs are to be processed on 2 or 3 machines. Then the job sequencing
can be done by the method of enumeration. If, however, the number of jobs and/or
machines increases, then the problem becomes complicated and the method of enumeration
is not suitable.
 BASIC TERMINOLOGIES
In the following, we describe the basic terminologies which are commonly used in job
sequencing :-

Number of Machines - It refers to the number of service facilities through which a

job must pass before it is assumed to be completed.

Processing Time - This is the time required by each job on each machine.

Processing Order - This refers to the order (sequence) in which machines are required for
completing the job.

Idle time on a Machine - This is the time during which a machine does not have a
job to process.

Total Elapsed Time - This is the time interval between starting the first job and completing
the last job, including the idle time (if any), in a particular order by the given set of
machines.
No Passing Rule - This means that the passing is not allowed, i.e., the same order
of jobs is maintained over each machine. If n jobs are to be processed through two
machines A and B in the order AB, then this means that each job will go to machine A first
and then to B.
 PRINCIPAL ASSUMPTIONS
General assumptions for sequencing problems are as follows :-

 The processing time on each machine is known.

 The time required to complete a job is independent of the order of jobs in which
they are to be processed.

 No machine can process more than one job simultaneously.

 The time taken by each job in changing over from one machine to another is
negligible.

 Each job, once started on a machine is to be performed up to completion on that

machine.

 The order of completion of job has no significance, i.e., no job is to be given

priority.

 A job starts on the machine as soon as the job and the machine both are idle.
 TYPES OF JOB SEQUENCING
PROBLEM
Various types of job sequencing problem arise in the world. All sequencing problems
cannot be solved. Here, we consider the following four types of job sequencing
problem :-

i) n jobs are to be processed on 2 machines, say, machine A and machine B in the

order AB. This means that each job is to be processed first on machine A and then on
machine B.

ii) n jobs are to be processed on 3 machines A, B and C in the order ABC, i.e., first
on machine A, second on machine B and third on machine C.

iii) n jobs are to be processed on m machines in the given order.

iv) 2 jobs are to be processed on m machines in the given order.

i) Processing of n Jobs through 2 Machines
Johnson’s Algorithm Method :-

Step 1 :- Select the minimum processing time out of all Ai ’s and Bi ’s. If it is Ar then do the rth
job first. If it is Bs then do the sth job at last.
Step 2 :- If there is a tie in selecting the minimum of all the processing times, then such a
situation is dealt with the following three ways:
(i) If the minimum of all the processing times is Ar , which is also equal to Bs,
that is, min(Ai ;Bi ) = Ar = Bs, then do the rth job first and sth job at last.
(ii) If min(Ai ;Bi ) = Ar , but Ar = Ak, i.e., there is a tie for minimum among
Ai ’s, then select any one.
(iii) If min(Ai ;Bi ) = Bs, but Bs = Bt , i.e., there is a tie for minimum among
Bi ’s, then select any one.
Step 3 :- Now, eliminate the job which has already been assigned from further consid-
eration, and repeat steps 1 and 2 until an optimal sequence is found.

Note: Johnson’s algorithm concentrates on minimizing the idle time of machines. It is

proved that the optimal sequence of n jobs which are to be processed on machine A and
machine B in the order AB necessarily involves the same ordering of jobs on each machine.
The total elapsed time is minimum when the sequence of jobs is same for both the machines.
ii) Processing of n Jobs through 3 Machines
Under this problem, If either or both the above conditions hold good, then the algorithm can
be summarized in the following steps :-

Step 1 :- Examine the processing times of the given jobs on all three machines and if either
one or both the above conditions hold, then go to Step 2; otherwise, the algorithm fails.

Step 2 :- Introduce two fictitious machines, say G and H, with corresponding processing
times given by:-
(i) tGj = t1j + t2j ; j = 1;2; ;n, i.e., the processing time on machine G is the sum of
the processing times on machines A and B.
(ii) tHj = t2j + t3j ; j = 1;2; ;n, i.e., the processing time on machine H is the sum of
the processing times on machines B and C.

Step 3 :- Determine the optimal sequence for n jobs and two machine equivalent sequencing
problem with the prescribed ordering GH in the same way as discussed
earlier.
 iii) Processing 2 Jobs through m Machines

Problems under this category can be solved with the help of graphical method.
The graphical method is explained with the help of the following example.
Example :- Two jobs are to be performed on five machines A, B, C, D, and E. Processing times
are given in the following table:
Solution :- The following steps are to be followed to solve the problem graphically:
i) Draw two perpendicular lines. Horizontal line represents the processing time for job 1 while job 2
remains idle, and vertical line represents processing time for job 2 while job 1 remains idle.
ii) Mark the processing times of job 1 and job 2 on the horizontal and vertical lines respectively
according to the given order of machines.
iii) Draw the rectangular blocks by pairing the same machines.
iv) Avoiding the rectangular blocks, draw the line starting from origin O to the end point, moving
horizontally, vertically and diagonally along a line which makes an angle 45o with the horizontal
line.
v) An optimum path minimizes the idle time for both the jobs. So, it is the path on which diagonal
movement is maximum.
vi) The elapsed time is obtained by adding the idle time for either job to the processing time for that
job. For this example, idle time for job 1 is 3+2 =5 hours. Elapsed time = processing time of job 1
+ idle time of job 1 = (3+4+2+6+2)+5 = 17 + 5 = 22 hours.
Likewise, idle time for job 2 is 2 hours. Elapsed time = processing time of job 2 + idle time of job 2 =
(5 + 4 + 3 + 2 + 6) + (2) = 20 + 2 = 22 hours.
 CONCLUSION

There is a need, in industry, for an efficient method of determining an optimal sequence for
processing a number ii of jobs through two or more machines. A method which requires a
minimum amount of time would be most beneficial.

The purpose of this study has been to define such a method.

Tests on the method described indicate that although an optimal solution is not always
obtained, the solutions obtained are quite good and due to the time factor the method would
be beneficial to industry.