Mass Customization and the “Parts-Procurement Planning Problem”
Published Online:19 Nov 2021https://doi.org/10.1287/mnsc.2021.4172
References
- (2013) Learning with submodular functions: A convex optimization perspective. Foundations Trends Machine Learn. 6(2-3):145–373.Crossref, Google Scholar
- (2008) Analysis of supply contracts with commitments and flexibility. Naval Res. Logist. 55(5):459–477.Crossref, Google Scholar
- (1999) Optimization Methods for Logical Inference (John Wiley & Sons, New York).Crossref, Google Scholar
- (2010) Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm. ACM Trans. Algorithms 6(4):63.Crossref, Google Scholar
- (2001) Mass customization: Literature review and research directions. Internat. J. Production Econom. 72(1):1–13.Crossref, Google Scholar
- (1978) Conditional gradient algorithms with open loop step size rules. J. Math. Anal. Appl. 62(2):432–444.Crossref, Google Scholar
- (1986) An outer-approximation algorithm for a class of mixed-integer non-linear programs. Math. Programming 36:307–339.Crossref, Google Scholar
- (2019) Mass customization and “forecasting options’ penetration rates problem.” Oper. Res. 67(4):1120–1134.Abstract, Google Scholar
- (1997) Mass customization at Hewlett-Packard: The power of postponement. Harvard Bus. Rev. 75:116–123.Google Scholar
- (1995) Configuration computer systems through constraint-based modeling and interactive constraint satisfaction. Comput. Indust. 27(1):3–21.Crossref, Google Scholar
- (2002) Computers and Intractability, vol. 29 (Freeman, New York).Google Scholar
- (1984) Production and Inventory Management (Prentice Hall Inc., Englewood Cliffs, NJ).Google Scholar
- (2007) Mass customization with configurable products and configurators: A review of benefits and challenges. Mass Customization for Personalized Communication Environments: Integrating Human Factors (IGI Global, Hershey, NY), 75–106.Google Scholar
- (2013) Revisiting Frank-Wolfe: Projection-free sparse convex optimization. Dasgupta S, McAllester D, eds. Proc. 30th Internat. Conf. Machine Learn. (PMLR, Atlanta), 28(1):427–435.Google Scholar
- (1992) A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training. Ann. Statist. 20(1):3608–613.Crossref, Google Scholar
- (2015) A system level product configurator for engineer-to-order supply chains. Comput. Indust. 72:82–91.Crossref, Google Scholar
- (1974) Material Requirements Planning: The New Way of Life in Production and Inventory Management (McGraw-Hill, Inc., New York).Google Scholar
- (1993) Partial linearization methods in nonlinear programming. J. Optim. Theory Appl. 78(2):227–246.Crossref, Google Scholar
- (1993) Mass Customization: The New Frontier in Business Competition (Harvard Business Press, Boston).Google Scholar
- (2011) Assortment selection and pricing for configurable products under demand uncertainty. Eur. J. Oper. Res. 210(3):635–646.Crossref, Google Scholar
- (1998) Product configuration frameworks-a survey. IEEE Intelligent Systems Their Appl. 13(4):42–49.Crossref, Google Scholar
- (1979) Mathematical Programming: Structures and Algorithms (John Wiley, New York).Google Scholar
- (2003) Supply chain operations: Assemble-to-order systems. Supply Chain Management 11(2003):561–596.Google Scholar
- (1999) The quantity flexibility contract and supplier-customer incentives. Management Sci. 45(10):1339–1358.Link, Google Scholar
- (1983) On the complexity of derivation in propositional calculus. Automation of Reasoning (Springer), 466–483.Google Scholar
- (1994) Fundamentals of Product Modularity (Springer, Dordrecht, Netherlands), 219–231.Crossref, Google Scholar
- (2013) Stabilisation and control of configurable product manufacturing through Biased Decision Feedback decoupling. J. Manufacturing Systems 32(1):271–280.Crossref, Google Scholar
- (1976) Material requirements planning under uncertainty. Decision Sci. 7(4):595–606.Crossref, Google Scholar
- (1990) Compact normal forms in propositional logic and integer programming formulations. Comput. Oper. Res. 17(3):309–314.Crossref, Google Scholar
- (1999) Tight representation of logical constraints as cardinality rules. Math. Programming 85(2):363–377.Crossref, Google Scholar
- (2017) Assemble-to-order systems: A review. Eur. J. Oper. Res. 261(3):866–879.Crossref, Google Scholar

