Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 6

Learning Outcome:

After undergoing this module, the student must be able to exhibit the knowledge
about

1. . Sequencing

2. Rationale of sequencing

3. Method of simulation using bellman Johnson rule

4. Case of 2 Machines X n jobs

5. 10 . Case of 3 machines X n jobs

6. Case of 2 jobs X M machines

4.7. Rationale of Sequencing


• It helps in reducing

1. Total elapsed operational time

2. Idle time of Jobs getting processed

3. Idle time of Machines/ operator

4. Optimization in resource cost

4.8. Scope of Sequencing It is applicable in


Finding optimal sequence of processing multiple jobs to two or more operators/
machines

4.9. Meaning of Sequencing


• Sequencing is a method of assigning different jobs to different machines /
operators in order to optimize the processing time and hence the cost.

4.10. Bellman Johnson’s rule of sequencing applicable to

a) n jobs X 2 Machines

b) n jobs X 3 machines

c) 2Jobs X m machines

4.11 Assumptions of Sequencing


• All the jobs needs to be processed on all machines

• The jobs follows the order of processing on all machines

• One job can be assigned to one operator or machine at one time only
• First time Once the job is assigned to one machine the other machine will be Idle till
it is processed.

• The Job and or Machine/Operator will be idle when either is busy.

4.12 Bellman Johnson’s Rule


a) n jobs X 2 M/c

1. Select the min of set of processing time of all jobs on all machines. If tie or more
than one job has got same min then select arbitrarily both jobs

2. Assign that min processing time job/s to corresponding operator/ Machine .

3. Discord the other machine or operator so that no more assignment is done for that
.

4. Repeat step 1 till all the jobs are assigned


Solution

You might also like