Please use this identifier to cite or link to this item:
|Title:||A multistage benders decomposition method for production planning problems with approved vendor matrices||Authors:||Lee, L.H.
|Keywords:||Approved Vendor Matrix
|Issue Date:||2005||Citation:||Lee, L.H., Chew, E.P., Ng, T.S. (2005). A multistage benders decomposition method for production planning problems with approved vendor matrices. Journal of Manufacturing Systems 24 (4) : 315-327. ScholarBank@NUS Repository. https://doi.org/10.1016/S0278-6125(05)80016-0||Abstract:||A production planning problem is studied based on an actual manufacturer of hard-disk drives that offers the approved vendor matrix as a competitive advantage. An approved vendor matrix allows customers to pick and choose the component suppliers for individual components or pairs of components constituting their product. The problem is to develop production plans that minimize the total tardiness in fulfilling customer orders while observing the matrix restrictions and limited component supplies. It is first shown that this problem has an equivalent multicommodity network flow representation. A solution procedure using multistage Benders decomposition is then developed. The computational efficiency of the approach is compared with the column-generation method and the CPLEX general-purpose LP solver under different scenarios of matrix restrictions. © 2005.||Source Title:||Journal of Manufacturing Systems||URI:||http://scholarbank.nus.edu.sg/handle/10635/54473||ISSN:||02786125||DOI:||10.1016/S0278-6125(05)80016-0|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.