Scribd
Upload
64 views29 pages

Operations Research VII SEMESTER (18ME735) Module - 5: Department of Collegiate and Technical Education

This document provides an introduction and overview of sequencing problems in operations research. It defines sequencing as determining the optimal order of jobs to be processed on a finite number of machines. The general problem is to minimize the total elapsed time between starting the first job and completing the last. The document outlines assumptions, terminology, and examples of 2-machine, 3-machine, and m-machine sequencing problems. It provides step-by-step solutions to sample problems and explains how to convert between problem types.

Uploaded by

jhansi lakshmi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
64 views29 pages

Operations Research VII SEMESTER (18ME735) Module - 5: Department of Collegiate and Technical Education

This document provides an introduction and overview of sequencing problems in operations research. It defines sequencing as determining the optimal order of jobs to be processed on a finite number of machines. The general problem is to minimize the total elapsed time between starting the first job and completing the last. The document outlines assumptions, terminology, and examples of 2-machine, 3-machine, and m-machine sequencing problems. It provides step-by-step solutions to sample problems and explains how to convert between problem types.

Uploaded by

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

Department of Collegiate and Technical Education

OPERATIONS RESEARCH
VII SEMESTER(18ME735)
Module -5
SESSION-1
Presented By:
Jhansi Lakshmi K P
Government Engineering College, Haveri

OPERATIONS RESEARCH 18ME735


INTRODUCTION
• The selection of an appropriate ORDER for a
series of jobs to be done on a finite number of
service facilities, in some pre-assigned order,
is called Sequencing.
• A practical situation may corresponds to an
industry producing a number of produces, each
of which is to be processed through different
machines, of course, finite in number.
The general sequencing problem may be
defined as: Let there be n jobs to be
performed, one at a time on m machines.
The actual or expected time required by
the jobs on each machines is also given. In
sequencing problems, therefore is to find
the sequence of out of (n!)m possible
sequences which minimizes the total
elapsed time between the start of the job in
the first machine and the completion of the
job on the last machine.

Mechanical Engineering 18ME43


Assumptions
• Each job once started on the machine, to be
performed till the completion on that machine.
• Processing time of each job is independent of
the order of the jobs in which they are to be
processed.
• The time taken by each job for changing over
from one machine to another is negligible.
• A job starts on the machine as soon as
the job and the machine both are idle
and job is next to machine and the
machine is also next to the job.
• No machine may process more than one
job simultaneously.
• The order of completion of job has no
significance, i.e. no job is to be given
priority. The order of completion of jobs
is independent of sequence of jobs.

Mechanical Engineering 18ME43


Mechanical Engineering 18ME43
Terminology
• 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 Order: It refers to the order (sequence) in which
given machines are required to operate for completing the job.
• Processing Time: It indicates the time required by a job on
each machine.
• Total elapsed time: It is the time interval between starting the
1st job and completing the last job including the idle time in a
particular order by the given set of machines.
• Idle time on a machine: It is the time for which a machine
does not have a job to process, i.e., idle time from the end of
job (i-1) to start of job i.
• Idle time on a machine: It is the time
for which a machine does not have a
job to process, i.e., idle time from the
end of job (i-1) to the start of job i.
• Processing Time: It indicates the time
required by a job on each machine
• No passing rule: It refers to the rule of
marinating the order in which jobs are
to be processes on given machines.

Mechanical Engineering 18ME43


Types of sequencing problems:
• “n” job 2 machine problem
• “n” job 3 machine problem
• “n” job “m” machine problem
• 2 job “n” machine problem
Processing n jobs through 2 machines
• Let there be n jobs, each of which is to be
processed through 2 machines, say M 1 =&M2 in
the order M1M2. That is, each job has to pass
through the same sequence of operations.

• Or, a job is assigned on M1 first and after it has been completely machine M1, it
is assigned to machine M2.
• for processing the
If the machine M2 is not free at that moment
same job, then the job has to wait in a waiting
line for its turn on machine M2 (no passing)
Mechanical Engineering 18ME43
• If the machine M2 is not free at the
moment for processing the same job,
then the job has to wait in a waiting line
for its turn on machine M2.(no passing)
• Let tij(i=1,2 and j=1,2,….n) be the time
required for processing jth job on ith
machine.
• Since passing is not allowed, therefore
machine M1 will remain busy in
processing all the n jobs one by one
while machine M2 may remain idle after
Completion of one job and before
starting of another job. Mechanical Engineering 18ME43
• The objective here is to minimise the
idle time of second machine.
• Let X2j be the time for which machine
M2 remains idle after finishing (j-1) th
job and before starting processing jth
job (j=1,2,….n).
• Total elapsed time (T) is
• The problem is to minimise T. however
is the total time for which machine M2
has to work and it does not form a part of
the optimization problem.

Mechanical Engineering 18ME43


Optimum sequence algorithm or Johnson’s
Algorithm
“n” job 2 machine Problem
“n” job 3 Machine Problem:
There are five jobs, each of which must go
through machines A,B and C in the order
ABC. Processing time (in hours) are given
below:
JOB 1 2 3 4 5
Machine A 10 11 8 7 6
Machine B 6 4 5 3 2
Machine C 9 5 4 6 8

Determine the optimal processing


sequence and total elapsed time?
Solution:
Step1: Convert this Problem into two machine problem. Check the
following condition:
Min A or Min CMax B
Here Min A=6, Min C=4, Max B=6
Therefore 6=6
Min A=Max B
Consolidation Table:
JOB New M/C1 New M/C2
P(A+B) New time R(B+C) New time
1 10+6 16 6+9 15
2 11+4 15 4+5 9
3 8+5 13 5+4 9
4 7+3 10 3+6 9
5 6+2 8 2+8 10

New job timing according to consolidated Table:


JOB 1 2 3 4 5
M/c P 16 15 13 10 8
M/c R 15 9 9 9 10
JOB SEQUENCE:

JOB 5 4 1 3 2
“n “ JOB ‘M’ Machine Problem:
“n “ JOB ‘M’ Machine Problem:
Example: There are 4 jobs to be processed on four machines
M1,M2,M3,M4 in that order. Determine optimal sequence and total
elapsed time.
Machines
JOB M1 M2 M3 M4
A 13 8 7 14
B 12 6 8 19
C 9 7 5 15
D 8 5 6 15

SOLUTION:
Step 1: Convert this problem to n job 2 machine problem
Min M1=8, Max M2,M3=8
Min M1=MaxM2,M3
The condition is satisfied, so the problem can be converted to n job 2 machine
problem.
Two virtual machines M/c P, M/C R
M/c P= M1+M2+M3
M/C R= M2+M3+M4
Consolidation Table
JOB Machine P Machine R
M1+M2 New M2+M3 New
+M3 time +M4 Time
A 13+8+7 28 8+7+14 29
B 12+6+8 26 6+8+19 33
C 9+7+5 21 7+5+15 27
D 8+5+6 19 5+6+15 26

JOB A B C D
M/C P 28 26 21 19
M/C R 29 33 27 26

OPTIMAL SEQUENCE:

D C B A

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy