Production Planning with Patterns: A Problem from Processed Food Manufacturing

• 成果类型: Article
• 署名作者: Mehrotra, Mili; Dawande, Milind; Gavirneni, Srinagesh; Demirci, Mehmet; Tayur, Sridhar
• 署名单位: University of Minnesota System; University of Minnesota Twin Cities; University of Texas System; University of Texas Dallas; Cornell University; Carnegie Mellon University
• 刊物名称: OPERATIONS RESEARCH
• ISSN/ISSBN: 0030-364X
• DOI: 10.1287/opre.1100.0871
• 发表日期: 2011
• 页码: 267-282
• 关键词: lot scheduling problem; industry

摘要

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.