Advanced Apparel
Manufacturing
Management
Assignment: 1
Submitted By:
Amit Raj Kishore
Prachi Yash
Shailja Sundaram
Vishal Kumar Rajak
To describe and explain the following topics:
Application of Operation Research in Production House
Objective Use of transportation, LPP, assignment, and sequencing in an
industry to make it more efficient and productive.
Operations research (OR) is an analytical method of
problem-solving and decision-making that is useful in
the management of organizations. In operations
Operation research, problems are broken down into basic
Research components and then solved in defined steps by
mathematical analysis.
The process of operations research can be broadly
broken down into the following steps:
1.Identifying a problem that needs to be solved.
2.Constructing a model around the problem that
resembles the real world and variables.
Process of OR 3.Using the model to derive solutions to the problem.
4.Testing each solution on the model and analyzing its
success.
5.Implementing the solution to the actual problem.
1.Optimization- The purpose of operations research is to
achieve the best performance under the given
circumstances. Optimization also involves comparing
and narrowing down potential options.
2.Simulation- This involves building models or
replications in order to try out and test solutions before
Characteristics applying them.
3.Probability and statistics- This includes using
mathematical algorithms and data to uncover helpful
insights and risks, make reliable predictions and test
possible solutions.
Factory size and location decision.
Estimation of number of facilities required.
Application of Preparation of forecasts for the various inventory items
and computation of economic order quantities and
Operation reorder levels.
Research in Scheduling and sequencing of production runs by
Production proper allocation of machines.
House Transportation loading and unloading
Warehouse location decisions
Maintenance policy decisions
Transportation Models in Operations Management is
a special case of linear programming that deals with
the issue of shipping commodities from multiple
Use of sources to multiple destinations.
Transportation Aim of Transportation Model To find out optimum
transportation schedule keeping in mind cost of
transportation to be minimized.
Definition The model requires only a few data elements:
Origin of supply
Destination
Unit cost of shipping (per-unit cost)
A product is to be transported from a number of
sources to a number of destinations at the minimum
possible cost.
Each source is able to supply a fixed number of units of
the product, and each destination has a fixed demand
Characteristics for the product.
The linear programming model has constraints for
supply at each source and demand at each destination.
All constraints are equalities in a balanced
transportation model where supply equals demand.
Constraints contain inequalities in unbalanced models
where supply is not equal to demand.
Balanced Transportation Problem
Types of Unbalanced Transportation Problem
Problems
North-West corner Method
Row Minima Method
Column Minima Method
Methods Least-Cost Method
Vogel’s Approximation Method
Minimize shipping costs
Determine low cost location
Application of Find minimum cost production schedule
transportation Military distribution system
model Manufacturing
Simplicity
Minimal total transportation cost
Advantages Saves times
Widely used mathematical modeling technique to
determine the optimum allocation of scarce resources
among competing demands. Resources typically
include raw materials, manpower, machinery, time,
money and space.
Use of LPP
For a given problem situation, there are certain essential
Introduction conditions that need to be solved by using linear
programming
Limited resources
Objective
Constraints
Decision Variables
A general representation of LP model is given as follows:
Maximize or Minimize, Z = p1 x1 + p2 x2 ………………pn xn
Subject to constraints,
w11 x1 + w12 x2 + ………………w1n xn ≤ or = or ≥ w1
General ……………(i)
Linear w21 x1 + w22 x2 ………………w2n xn ≤ or = or ≥ w2
Programming …………… (ii)
.....
Model
.....
wm1 x1 + wm2 x2 +………………wmn xn ≤ or = ≥ wm
…………(iii) Non-negativity constraint,
xi ≥ o (where i = 1,2,3 …..n)
Production scheduling problem
Trim loss problems
Application of Blending problems
LPP in
Product mix problems
Industry
Assembly line balancing
Make – or – buy (subcontracting) problems
Quality Decision
Complex Problem
Advantages of Maximization of Resources
LPP in
Industry Multiple constraints
Simplicity
Multipurpose
A company manufactures two types of boxes, corrugated and ordinary
cartons.
The boxes undergo two major processes: cutting and pinning
operations.
The profits per unit are Rs. 6 and Rs. 4 respectively.
Examples Each corrugated box requires 2 minutes for cutting and 3 minutes for
pinning operation, whereas each carton box requires 2 minutes for
cutting and 1 minute for pinning.
The available operating time is 120 minutes and 60 minutes for cutting
and pinning machines.
The manager has to determine the optimum quantities to be
manufacture the two boxes to maximize the profits.
Assignment problem refers to special class of linear
programming problems that involves determining the
most efficient assignment of people to projects,
salespeople to territories, contracts to bidders and so
Use of on.
Assignment
It is often used to minimize total cost or time of
performing task.
Introduction One important characteristic of assignment problems
is that only one job (or worker) is assigned to one
machine (or project).
Minimization type of assignment problems.
Types
Maximization type of assignment problems
1. Balanced
2. Unbalanced
Assignment problems having non-square
cost matrix
Method
In assigning machines to factory orders.
In assigning sales/marketing people to sales
territories.
Application in
Industry In assigning contracts to bidders by
systematic bid-evaluation.
In assigning accountants to accounts of the
clients.
Let there be ‘n’ jobs (1,2,3…….n) which are to be
processed on ‘m’ machines (A, B, C……) where the
order of processing on machines and the processing
Use of time of jobs on machines is known to us, then our aim
Sequence is to find the optimal sequence of processing jobs that
minimizes the total processing time/ cost.
Hence our job is to find that sequence out of (n!)m
Introduction sequences, which minimizes the total processing time /
cost.
The processing times Ai and Bi etc. are exactly known
to us and they are independent of order of processing
the job on the machine. (i.e) the time taken to process
the job will not vary it remains constant.
The given processing time includes the transfer time
and setup time.
Assumptions Each job once started on the machine, the processing
shouldn’t stop in the middle. It is to be processed
completely before loading the next job.
The job starts on the machine as soon as the job and
the machine both become idle.
‘n’ jobs are to be processed on two machines say
machine A and machine B in the order AB. This means
that the job is to be processed first on machine A and
then on machine B.
‘n’ jobs are to be processed on three machines A,B and
C in the order ABC i.e. first on machine A, second on
Types machine B and third on machine C.
‘n’ jobs are to be processed on ‘m’ machines in the
given order
Two jobs are to be processed on ‘m’ machines in the
given order.
Identify the smallest time element in the first column.
Identify the smallest time element in the third column
Identify the highest time element in the second column
Procedure Now minimum time on machine 1(Ar ≥ maximum time
element on machine 2,Bi)
http://ir.knust.edu.gh/bitstream/123456789/3872/1/ALFRED%20AS
ASE%20THESIS.pdf
https://study.com/academy/lesson/the-transportation-model-met
hod-uses-examples.html
http://article.sapub.org/10.5923.j.logistics.20180701.02.html
https://www.helpwithassignment.com/blog/transportation-
models-in-operations-management-from-helpwithassignment-
References com/#:~:text=Transportation%20Models%20in%20Operations
%20Management%20is%20a%20special%20case%20of,multiple
%20sources%20to%20multiple%20destinations
https://www.slideshare.net/lokeshpayasi/transportation-model-4
847369
https://www.slideshare.net/priyankayadav91/transportation-mod
el-and-assignment-model
https://www.slideshare.net/lokeshpayasi/transportation-and-assig
nment
https://www.yourarticlelibrary.com/ergonomics/operation-researc
h/operation-research-applications-methodology-and-tools/90745
Thankyou!
