The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Managing Broader Product Lines through Delayed Differentiation Using Vanilla Boxes
Abstract
In an attempt to reduce cost while maintaining good customer service, some of the leading manufacturers in the computer industry are delaying product differentiation (by exploiting component commonality) while managing broader product lines. In an environment where demands are stochastic, it seems a good strategy to store inventory in the form of semi-finished products (vanilla boxes) that can serve more than one final product. However, finding the optimal configurations and inventory levels of the vanilla boxes could be a challenging task. In this paper, we model the above problem as a two-stage integer program with recourse. By utilizing structural decomposition of the problem and (sub)gradient derivative methods, we provide an effective solution procedure. A special case, a variant, and several extensions are also discussed. In our computational section, we utilize our model to study several new research issues. We provide insights on the effect of demand variance, correlation, and capacity limitations on the optimal configuration and inventory levels of vanilla boxes and the performance of a vanilla assembly process. In addition, we compare the performance of the vanilla assembly process to make-to-stock and assemble-to-order processes and provide managerial insights on the conditions under which one might be better than the others. Finally, we discuss the characteristics of an IBM product line (which motivated this work) and the effectiveness of a heuristic tailored for that application.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Nonlinear programming: theory and algorithms
(1993) · Computers & Operations Research · doi:10.1016/0305-0548(93)90042-h · Cited by 5,779
Nonlinear Programming — Theory and Algorithms
Ovuworie, G. C. (1979) · Journal of the Operational Research Society · doi:10.1057/jors.1979.231 · Cited by 1,182
Material Management in Decentralized Supply Chains
Lee, H. L., & Billington, C. (1993) · Operations Research · doi:10.1287/opre.41.5.835 · Cited by 784
The integer L-shaped method for stochastic integer programs with complete recourse
Laporte, G., & Louveaux, F. V. (1993) · Operations Research Letters · doi:10.1016/0167-6377(93)90002-x · Cited by 778
Jaikumar, R. (1986) · Harvard business review · Cited by 748
Making supply meet demand in an uncertain world
Fisher, M. L., Hammond, J. H., OBERMEYER, W., & Raman, A. (1994) · Harvard business review · Cited by 744
Strategic Analysis of Integrated Production-Distribution Systems: Models and Methods
Cohen, M. A., & Lee, H. L. (1988) · Operations Research · doi:10.1287/opre.36.2.216 · Cited by 619
Broader Product Line: A Necessity to Achieve Success?
Kekre, S., & Srinivasan, K. (1990) · Management Science · doi:10.1287/mnsc.36.10.1216 · Cited by 550
(1990) · Long Range Planning · doi:10.1016/0024-6301(90)90240-5 · Cited by 303
Principles of marketing management
Bagozzi, R. P. (1986) · Medical Entomology and Zoology · Cited by 291
Variability Reduction Through Operations Reversal
Lee, H. L., & Tang, C. S. (1998) · Management Science · doi:10.1287/mnsc.44.2.162 · Cited by 152
Cited by
Perspectives in supply chain risk management
Tang, C. S. (2006) · International Journal of Production Economics · doi:10.1016/j.ijpe.2005.12.006 · Cited by 2,577
Product Development Decisions: A Review of the Literature
Krishnan, V., & Ulrich, K. T. (2001) · Management Science · doi:10.1287/mnsc.47.1.1.10668 · Cited by 1,701
ElMaraghy, H., Schuh, G., ElMaraghy, W., Piller, F., Schönsleben, P., Tseng, M., & Bernard, A. (2013) · CIRP Annals · doi:10.1016/j.cirp.2013.05.007 · Cited by 587
Assembly system design and operations for product variety
Hu, S. J., Ko, J., Weyand, L., ElMaraghy, H. A., Lien, T. K., Koren, Y., Bley, H., Chryssolouris, G., Nasr, N., & Shpitalni, M. (2011) · CIRP Annals · doi:10.1016/j.cirp.2011.05.004 · Cited by 511
Models for Supply Chains in E-Business
Swaminathan, J. M., & Tayur, S. R. (2003) · Management Science · doi:10.1287/mnsc.49.10.1387.17309 · Cited by 480
Self-citation
Metadata
- Authors
- Swaminathan, J. M., & Tayur, S. R.
- Venue
- Management Science
- Published
- 1998-12
- Volume
- 44
- Issue
- 12-part-2
- Pages
- S161-S172
- ISSN
- 0025-1909 (ISSN-L)
- 1526-5501
- OpenAlex
- W2162581541
- Cited by
- 300
- References
- 11
- FWCI
- 18.04
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.