Scribd
Upload
16 views4 pages

Sequencing Problem

The document discusses sequencing problems, which involve determining the optimal order for jobs to be processed on a set of machines to minimize total elapsed time. It outlines the assumptions, basic terms, and provides a step-by-step algorithm for processing jobs through two machines, including how to handle ties in processing times. The document also explains how to calculate idle time and total elapsed time for the job processing sequence.

Uploaded by

abubakarumarchiroma
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
16 views4 pages

Sequencing Problem

The document discusses sequencing problems, which involve determining the optimal order for jobs to be processed on a set of machines to minimize total elapsed time. It outlines the assumptions, basic terms, and provides a step-by-step algorithm for processing jobs through two machines, including how to handle ties in processing times. The document also explains how to calculate idle time and total elapsed time for the job processing sequence.

Uploaded by

abubakarumarchiroma
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/ 4

SEQUENCING PROBLEMS

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


products, 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 on each of m machines. The sequence (order) of the
machines in which each job should be performed is given. The actual or
expected time required by the jobs on each of the machines is also given. The
general sequencing problem, therefore, is to find the sequence out of (n!)m
possible sequences which minimize the total elapsed time between the start of
the job in the first machine and the completion of the job on the last machine.

Assumptions:
• Each job once started on a machine, is to be performed up to completion
on that machine.

• The processing time on each machine is known. Such a time is


independent of the order of the jobs in which they are to be processed.

• The time taken by each job in 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 the 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.

Basic Terms:
Number of Machines: It refers to the no. of service facilities through which a job
must pass before it is assumed to be completed.

1
Processing Order: It refers to the order (sequence) in which given machines are
required 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 the start of jobs i.

Processing Time: It indicates the time required by a job on each machine.

No passing rule: It refers to the rule of maintaining the order in which jobs are to
be processed on given machines.

Process ‘n’ jobs through two Machines:


Optimum Sequence of Algorithm:

1. List the jobs along with their processing times in a table.

Job Number : J1 J2 J3 ....................... Jn


M1 : t11 t 12 t 13 .......... t1n
ProcessingTime on machine 
M2 : t 21 t 22 t 23 .......... t 2n

2. Examine the rows for processing times on machines M1 and M2, and find
the smallest processing time in each row, i.e. find out min.(t1j, t2j) for all j.
3. If the smallest processing time is for the first machine M1, then place the
corresponding job in the 1st available position in the sequence, otherwise
place 2nd machine M2.
4. If there is a tie in selecting the minimum of all the processing times, then
there may be 3 situations
a) Minimum among all processing times is same for the machines, i.e.,
min.(t1j, t2j)= t1k = t2r, then process the kth job first and the rth job last.
b) If the tie for minimum occurs among processing times t1j on machine M1
only, then select arbitrarily the job to process first.
c) If the tie for minimum occurs among processing times t2j on machine M2,
then select arbitrarily the job to process last.

2
d) Cross off the jobs already assigned and repeat steps 1 through 4, placing
the remaining jobs next to first or next to last, until all the jobs have been
assigned
 Calculate idle time for machines M1 and M2:
Idle time for M1 = Total elapsed time –(time when the last job in a
sequence finishes on M1.
Idle time for M2= Time at which the 1st job in a sequence finishes on
M1 + (time when the jth job in a sequence starts on M2) – {(time
when the (j-1)th job in a sequences finishes on M2)}

 The total elapsed time to process all jobs through 2 machines as


under:

Total elapsed time  Time when the nth job in a sequence finisheson machine M2

n n
  t 2j  I2j
j2 j2

Where, t 2j  Time requiredfor processing jth job on machine M2


I2j  Time for which machine M2 remains idle after processing(j-1)th
job and beforestarting work on jth job.

You might also like