Article ID: | iaor200656 |
Country: | Netherlands |
Volume: | 162 |
Issue: | 2 |
Start Page Number: | 310 |
End Page Number: | 324 |
Publication Date: | Apr 2005 |
Journal: | European Journal of Operational Research |
Authors: | Chew E.P., Lee L.H., Ng T.S. |
Keywords: | programming: integer |
We develop an optimal production schedule for a manufacturer of hard-disk drives that offers its customers the approved vendor matrix (AVM) as a competitive advantage. An AVM allows each customer to pick and choose the various product component vendors for individual or pairs of components constituting their product. The production planning problem faced by the manufacturer is to meet customer demand as precisely as possible while observing the matrix restrictions and also the limited availability of production resources. We formulate this problem as a linear programming model with a large number of variables, and present a solution procedure based on the column generation technique. A special class of the problem is then studied, whereby the number of production setups in each period is limited and discrete. We modify our formulation into a mixed-integer problem, and proceed to develop procedures that can obtain good feasible solutions using linear programming rounding techniques.