Strategic Allocation of Resources
Strategic Allocation of Resources
One approach used by many leading companies in recent years to make the most of their limited resources is OPERATIONS RESEARCH.
Operation research refers to the application of quantitative methods and techniques to business problems in order to best utilize a companys resources. Operation research posses the knowledge and skills to analyze business problems and apply different quantitative tools to improve operations .
All operation managers must use as few of their resources as necessary to accomplish as much of their operations strategies as possible.
As operations managers develop operations strategies, they make decision about Positioning the production system, Focusing the factories, Designing products and Developing production processes, Determining production capacity and Facility location, and Facility layout. They use a variety of computer software packages in these efforts.
Resources refers to personnel, machines and equipment, cash and capital funds, materials and supplies, utilities, floor space, time and other resources.
Resource scarcities can cause hectic shifts in operations strategies to meet objectives; additionally, many resource prices are skyrocketing. The limited quantity of resources available and their high prices act as a double barreled incentives to use them to the greatest advantage. Today Operations managers understands that operations strategies must be accomplished within constraints imposed on their organizations by the shortage of resources.
One of the ways that operations managers determine how best to allocate their Scarce resources is with the use of LINEAR PROGRAMMING (LP). Five common types of LP problems are encountered by the operations managers are : a) Product Mix b) Ingredient Mix c) Transportation d) Production plan e) Assignment LP describes each problem type by posing three questions : What is the single management objective? What information do we need to achieve out objective? What factors restrain us from achieving our objective? Product Mix and Assignment Problems are integral to the development of longrun business.
The complexity of constraints decisions like large quantity of data, many products and services, many time periods, numerous decision alternatives prompted the development of linear programming methods.
LP is a powerful tool in POM, powerful because of the variety of uses to which it is put by operations managers.
4. The objective and each of the constraints must be expressed as linear mathematical function.
As a part of its strategic planning, Precision Manufacturing Company must determine the mix of its products to be manufactured next year. The company produces two principle product lines for the commercial construction industry, a line of powerful portable circular saws and a line of precision table saws. The two product line shares the same production capacity and are sold through the same sales channels. Although some product variety exists within each product line, the average profit is $900 for each circular saw and $600 for each table saw. The production capacity constrained in two ways, fabrication and assembly capacity. A maximum of 4000 Hrs of fabrication is available per month, and each circular saw requires 2 Hrs and each table saw requires 1 Hr. A maximum of 5000 Hrs of assembly capacity is available per month, and each circular saw requires ! Hr and each table saw requires 2 Hrs. The marketing department estimates that there is a maximum market demand next year of 3,500 saws per month for both product lines combined. How many circular saws and how many table saws should be produced monthly next year to maximize the profits ?
Graphical LP solutions :
The Graphical solution approach conceptually demonstrates the process of LP solutions to those who have no experience in LP. Graphical solutions are therefore intended as a teaching tool to assist you in understanding the process of LP solutions.
The simplex transportation and assignment methods are the practical LP solutions tools.
6. Substitute each of the potential solution point of the two decision variables into the objective function and solve for Z.
7. Select the solution point that optimizes Z.