An approach to product variety management in the painted sheet metal industry

Authors:
Luis Jacob Escobar-Saldívar;Neale R. Smith;José Luis González-Velarde
Affiliations:
Center for Quality and Manufacturing, Tecnológico de Monterrey, Eugenio Garza Sada 2501, 64849 Monterrey, NL, Mexico;Center for Quality and Manufacturing, Tecnológico de Monterrey, Eugenio Garza Sada 2501, 64849 Monterrey, NL, Mexico;Center for Quality and Manufacturing, Tecnológico de Monterrey, Eugenio Garza Sada 2501, 64849 Monterrey, NL, Mexico
Venue:
Computers and Industrial Engineering
Year:
2008

Citing 5
Cited 0

The discrete two-dimensional assortment problem

Operations Research
A Survey of Mathematical Programming Applications in Integrated Steel Plants

Manufacturing & Service Operations Management
An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems

Management Science
Technical Note: Mathematical Properties of the Optimal Product Line Selection Problem Using Choice-Based Conjoint Analysis

Management Science
Exact Algorithm for Concave Knapsack Problems: Linear Underestimation and Partition Method

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the painted sheet metal industry, offering a great variety of colors is an important competitive factor. However, an excessive number of colors can lead to excessive setup costs/times, inventory costs, and administrative complexity. In this paper, we address the case of a large manufacturer of painted sheet metal products located in northern Mexico. Several methods, both exact and heuristic, are proposed to optimize the variety of colors the firm offers. The exact method is based on mixed integer programming and the heuristic methods are variations of greedy algorithms. The methods are tested with real company data. The methods that perform better are identified and considerations are discussed which can affect the choice of method in a practical setting.