Please use this identifier to cite or link to this item:
|Title:||A gradient search and column generation approach for the build-pack planning problem with approved vendor matrices and stochastic demand|
|Keywords:||cycle time reduction|
|Source:||Sun, G., Lee, L.H., Chew, E.P., Shao, J. (2010-10-01). A gradient search and column generation approach for the build-pack planning problem with approved vendor matrices and stochastic demand. International Journal of Production Research 48 (19) : 5783-5807. ScholarBank@NUS Repository. https://doi.org/10.1080/00207540903049381|
|Abstract:||We study a production planning problem of product assembly with random demand, 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 minimise the expected total shortage and holding costs while observing the matrix restrictions and limited component supplies. We provide a mathematical programming formulation of the problem with a large number of decision variables, whose cost function is the solution of a parametric stochastic transportation problem. We present a gradient-based interior-point approach to solve this problem where the gradient is estimated by the shadow price from the solution of such a transportation problem. A column generation scheme is integrated into the approach to handle the large problem issue. Computational results show that our algorithm significantly improves the computational time when compared with the approach without column generation. In addition, we also discuss some extensions of the basic problem to the multi-period rolling horizon case. © 2010 Taylor & Francis.|
|Source Title:||International Journal of Production Research|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 22, 2018
WEB OF SCIENCETM
checked on Jan 24, 2018
checked on Feb 19, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.