Assignment No 1

1) Explain following terminology

a) Number of Machines
In business mathematics, the term "Number of Machines" typically refers to the quantity of machinery
or equipment available within a business or production facility. This terminology is commonly used in
various financial and operational calculations, particularly in scenarios involving manufacturing,
production, or service delivery where machinery plays a significant role.
b) Processing time

In the context of business mathematics or operations management, "Processing Time" refers to the
amount of time required to complete a specific task or operation within a production or service
environment. This term is crucial for understanding and optimizing the efficiency of various processes
within a business.

c) Processing order

In business operations, particularly in manufacturing and service industries, "Processing Order" refers
to the sequence or priority in which tasks, jobs, or orders are handled within a production or service
system. It involves determining the order in which tasks or orders are initiated, processed, and
completed.

d) Idle time on machine

"Ide Time on Machine" refers to the period during which a machine remains unused or inactive, despite
being available and capable of performing its intended functions. In industrial or manufacturing
settings, idle time on a machine represents a loss of potential productivity and efficiency.

e) Total Elapsed time

"Total Elapsed Time" refers to the overall duration or amount of time that has passed from the start to
the end of a specific process, task, event, or project. It represents the total time elapsed, inclusive of all
individual time intervals, pauses, and delays that occur during the duration of the process.

2) Explain the Principal assumptions made while dealing with sequencing problem.
A- 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.
3) Find the sequence that minimizes the total elapsed time required to complete the
following tasks on two machines

Task A B C D E F G H I
Machine I 2 5 4 9 6 8 7 5 4
Machine II 6 8 7 4 3 9 3 8 11

a-

The minimum processing time on two machines is 2 which correspond to task A on machine
P. This shows that task A will be preceding first. After assigning task A, we are left with 8
tasks on two machine
4) We have five jobs, each of which must be processed on two machines A and B in
order AB. Processing time in hours are given in the table below:

Jobs 1 2 3 4 5
Machine A 5 1 9 3 10
Machine B 2 6 7 8 4

Determine a sequence for five jobs that will minimized the elapsed time T.
A-
 Idle time for A → (28 to 30hrs ) = 2hrs Idle time for B → (0 − 1,22 − 23,27 − 28) = 3hrs

5) We have six jobs each of which must go through the machines A, B and C in order
ABC. Processing time (in Hours) is as follows:

Jobs A B C D E F G
Machine I 3 8 7 4 9 8 7
Machine II 4 3 2 5 1 4 3
Machine III 6 7 5 11 5 6 12

Determine a sequence for five jobs that will minimized the elapsed time T.
A-

To minimize the elapsed time �T for five jobs going through machines A, B, and C in order, we can use the
Johnson's Rule. However, since we have three machines for each job, we need to consider the machine with the
longest processing time for each job.

First, let's calculate the processing times for each job on each machine:
 Now, let's rearrange the jobs based on their corresponding machines with the
longest processing time in ascending order:

. Jobs with Machine II (Shortest processing time first): E

. Jobs with Machine I (Shortest processing time first): C, F
. Jobs with Machine III (Shortest processing time first): B, D

The sequence for five jobs that minimizes the elapsed time of T is E,C,F,B,D.
窗体顶端

窗体底端

6) Find the sequence that minimizes the total elapsed time required to complete the
following tasks. Each job is processed in the order ABC.

Jobs 1 2 3 4 5 6 7
Machine A 12 6 5 11 5 7 6
Machine B 7 8 9 4 7 8 3
Machine C 3 4 1 5 2 3 4
A-