OR PRACTICE---Production Planning with Patterns: A Problem from Processed Food Manufacturing

Mili Mehrotra (), Milind Dawande (), Srinagesh Gavirneni (), Mehmet Demirci () and Sridhar Tayur ()
Additional contact information
Mili Mehrotra: Carlson School of Management, University of Minnesota, Minneapolis, Minnesota 55455
Milind Dawande: School of Management, University of Texas at Dallas, Richardson, Texas 75080
Srinagesh Gavirneni: Johnson Graduate School of Management, Cornell University, Ithaca, New York 14853
Mehmet Demirci: SmartOps Corporation, Pittsburgh, Pennsylvania 15212
Sridhar Tayur: Tepper School of Business, Carnegie Mellon University, and SmartOps Corporation, Pittsburgh, Pennsylvania 15212

Operations Research, 2011, vol. 59, issue 2, 267-282

Abstract: Based on our work with ConAgra Foods (http://www.conagrafoods.com), a leading U.S. food manufacturer, we study a large-scale production-planning problem. The problem incorporates several distinguishing characteristics of production in the processed-food industry, including (i) production patterns that define specific combinations of weeks in which products can be produced, (ii) food groups that classify products based on the allergens they contain, (iii) sequence-dependent setup times, and (iv) manufacture of a large number of products (typically, around 200--250) on multiple production lines (typically, around 15--20) in the presence of significant inventory holding costs and production setup costs. The objective is to obtain a minimum-cost four-week cyclic schedule to resolve three basic decisions: (a) the assignment of products to each line, (b) the partitioning of the demand of each product over the lines to which it is assigned, and (c) the sequence of production on each line.We show that the general problem is strongly NP-hard. To develop intuition via theoretical analysis, we first obtain a polynomially solvable special case by sacrificing as little of its structure as possible and then analyzing the impact of imposing production patterns. A mixed-integer programming model of the general problem allows us to assess the average impact of production patterns and production capacities on the cost of an optimal schedule. Next, to solve practical instances of the problem, we develop an easy-to-implement heuristic. We first demonstrate the effectiveness of the heuristic on a comprehensive test bed of instances; the average percentage gap of the heuristic solution from the optimum is about 3%. Then, we show savings of about 28% on a real-world instance (283 products, 17 production lines) by comparing the schedule obtained from the heuristic to one that was in use (at ConAgra) based on an earlier consultant's work. Finally, we discuss the IT infrastructure implemented to enable the incorporation of optimized (or near-optimized) solutions for ongoing use.

Keywords: production planning; food industry; integer programming algorithms (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1100.0871 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:59:y:2011:i:2:p:267-282

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().