Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/63268
Title: Production planning with approved vendor matrices for a hard-disk drive manufacturer
Authors: Lee, L.H. 
Chew, E.P. 
Ng, T.S. 
Keywords: Approved vendor matrix
Column generation
Production planning
Issue Date: 16-Apr-2005
Citation: Lee, L.H., Chew, E.P., Ng, T.S. (2005-04-16). Production planning with approved vendor matrices for a hard-disk drive manufacturer. European Journal of Operational Research 162 (2) : 310-324. ScholarBank@NUS Repository.
Abstract: 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. © 2003 Elsevier B.V. All rights reserved.
Source Title: European Journal of Operational Research
URI: http://scholarbank.nus.edu.sg/handle/10635/63268
ISSN: 03772217
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

4
checked on May 19, 2018

WEB OF SCIENCETM
Citations

4
checked on May 23, 2018

Page view(s)

30
checked on Nov 10, 2018

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.