Production and inventory management under multiple resource constraints

  • Authors:
  • Kurt M. Bretthauer;Bala Shetty;Siddhartha Syam;Robert J. Vokurka

  • Affiliations:
  • Department of Operations and Decision Technologies, Kelley School of Business, Indiana University, Bloomington, IN 47405, United States;Department of Information and Operations Management, Lowry Mays College of Business, Texas A&M University, College Station, TX 77843, United States;Department of Management, College of Business Administration, Marquette University, Milwaukee, WI 53201, United States;Department of Economics, Finance, and Decision Sciences, College of Business, Texas A&M University-Corpus Christi, Corpus Christi, TX 78412, United States

  • Venue:
  • Mathematical and Computer Modelling: An International Journal
  • Year:
  • 2006

Quantified Score

Hi-index 0.98

Visualization

Abstract

In this paper we present a model and solution methodology for production and inventory management problems that involve multiple resource constraints. The model formulation is quite general, allowing organizations to handle a variety of multi-item decisions such as determining order quantities, production batch sizes, number of production runs, or cycle times. Resource constraints become necessary to handle interaction among the multiple items. Common types of resource constraints include limits on raw materials, machine capacity, workforce capacity, inventory investment, storage space, or the total number of orders placed. For example, in a production environment, there may be limited workforce capacity and limits on machine capacities for manufacturing various product families. In a purchasing environment where a firm has multiple suppliers, there are often constraints for each supplier, such as the total order from each supplier cannot exceed the volume of the truck. We present efficient algorithms for solving both continuous and integer variable versions of the resource constrained production and inventory management model. The algorithms require the solution of a series of two types of subproblems: one is a nonlinear knapsack problem and the other is a nonlinear problem where the only constraints are lower and upper bounds on the variables. Computational testing of the algorithms is reported and indicates that they are effective for solving large-scale problems.