Please use this identifier to cite or link to this item:
|Title:||Build-pack planning for hard disk drive assembly with approved vendor matrices and stochastic demands|
|Authors:||Ng, T.S. |
|Keywords:||Approved vendor matrix|
|Source:||Ng, T.S., Lee, L.H., Chew, E.P. (2006-12-01). Build-pack planning for hard disk drive assembly with approved vendor matrices and stochastic demands. European Journal of Operational Research 175 (2) : 1117-1140. ScholarBank@NUS Repository. https://doi.org/10.1016/j.ejor.2005.06.034|
|Abstract:||We study a production planning problem based on hard-disk drive assembly, where the customers choose their preferred suppliers for pairs of inter-dependent components through the approved vendor matrix. The problem is to develop production plans that minimize the expected total shortage and holding costs while observing the matrix restrictions and limited components supplies. We provide a mixed-integer formulation of the problem, whose linear approximation and relaxation is solved using the column generation method. This is then embedded in a branch-and-price framework to solve the mixed-integer problem. Special branching rules are devised to preserve the structure of the pricing sub-problem at each branch-and-bound node. Finally we present some computational results of our implementation. © 2005 Elsevier B.V. All rights reserved.|
|Source Title:||European Journal of Operational Research|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 15, 2018
WEB OF SCIENCETM
checked on Nov 22, 2017
checked on Jan 19, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.