INTRODUCTION TO STORAGE AND WAREHOUSING

By -

INTRODUCTION

Storage and warehousing operations are a critical part of maintaining a profitable business. With over 300,000 large warehouses and 2.5 million employees in the United States, the cost of American warehousing is over 5% of the gross national product. In the past few years, the field of warehousing has begun to receive the attention it deserves. However, the warehouse management has been asked to increase customer service, reduce inventories, increase productivity, handle a large number of stock- keeping units, and improve space utilization. Warehouse management has realized that these conflict- ing objectives require a much more professional approach than previously adopted. It is critical that today’s warehouse management follow this approach to achieve the results expected by today’s upper management.

1.1. Warehousing Defined

The functions performed by a warehouse are:

1. Receiving the goods from a source

2. Storing the goods

3. Picking the goods when they are required

4. Shipping the goods to the appropriate customer

Oftentimes, a distinction is made between a finished-goods warehouse and a raw-materials storeroom. The fact is, however, that the functions performed in a finished-goods warehouse—receive, store, pick, and ship—are identical to the functions performed in a raw-materials storeroom. Consequently, both are warehouses. The only true distinctions between the two are the source from which the goods are received and the user to whom the goods are shipped. A raw-materials storeroom receives goods from an outside source, stores the goods, picks the goods, and ships the goods to an inside user. A finished-goods warehouse receives goods from an inside source, stores the goods, picks the goods, and ships the goods to an outside user. Likewise, an in-process inventory warehouse receives goods from an inside source, stores the goods, picks the goods, and ships the goods to an inside user, while a distribution warehouse receives goods from an outside source, stores the goods, picks the goods, and ships to an outside user. The differences among these various warehouses are restricted to the perspectives of the sources, management, and users of the warehouses. If the primary functions of an activity are receive, store, pick, and ship, the activity is a warehouse, regardless of its position in a company’s logistics. The tools and techniques presented in this chapter can be successfully used to plan and manage that activity.

1.2. The Value of Warehousing in Today’s Economy

It is important to ponder the question ‘‘Does warehousing add value to a product?’’ The traditional school of thought has concluded that no, warehousing does not add value to a product; warehousing is strictly a cost-adding activity that is a necessary evil. In firms that follow this school of thought, warehousing costs are typically classified as indirect costs. Often these cost categories are spread over the direct costs of the firm in such a way that the cost of warehousing is not distinguishable.

Comments

Post a Comment

Popular posts from this blog

DUALITY THEORY:THE ESSENCE OF DUALITY THEORY

By -
Image
THE ESSENCE OF DUALITY THEORY Given our standard form for the primal problem at the left (perhaps after conversion from another form), its dual problem has the form shown to the right. Thus, with the primal problem in maximizatio n form, the dual problem is in minimization form instead. Furthermore, the dual problem uses exactly the same pa r amete r s as the primal problem, but in different locations, as summarized below. 1. The coefficients in the objective function of the primal problem are the right-hand sides of the functional constraints in the dual problem. 2. The right-hand sides of the functional constraints in the primal problem are the coef- ficients in the objective function of the dual problem. 3. The coefficients of a variable in the functional constraints of the primal problem are the coefficients in a functional constraint of the dual problem. To highlight the comparison, now look at these same two problems in matrix notation (as introduced at the beginn
Read more

NETWORK OPTIMIZATION MODELS:THE MINIMUM SPANNING TREE PROBLEM

By -
Image
THE MINIMUM SPANNING TREE PROBLEM The minimum spanning tree problem bears some similarities to the main version of the shortest-path problem presented in the preceding section. In both cases, an undi r ecte d and connected network is being considered, where the given information includes some mea- sure of the positive length (distance, cost, time, etc.) associated with each link. Both problems also involve choosing a set of links that have the shortest total length among all sets of links that satisfy a certain property. For the shortest-path problem, this property is that the chosen links must provide a path between the origin and the destination. For the minimum spanning tree problem, the required property is that the chosen links must provide a path between ea c h pair of nodes. The minimum spanning tree problem can be summarized as follows: 1. You are given the nodes of a network but not the links. Instead, you are given the po- tential links and the positive length for each
Read more

NETWORK OPTIMIZATION MODELS:THE SHORTEST-PATH PROBLEM

By -
Image
THE SHORTEST-PATH PROBLEM Although several other versions of the shortest-path problem (including some for directed networks) are mentioned at the end of the section, we shall focus on the following simple version. Consider an undi r ecte d and connected network with two special nodes called the origin and the destination. Associated with each of the links (undirected arcs) is a non- negative distance. The objective is to find the shortest path (the path with the minimum total distance) from the origin to the destination. A relatively straightforward algorithm is available for this problem. The essence of this procedure is that it fans out from the origin, successively identifying the shortest path to each of the nodes of the network in the ascending order of their (shortest) distances from the origin, thereby solving the problem when the destination node is reached. We shall first outline the method and then illustrate it by solving the shortest-path problem encountered by the See
Read more