Mining Pareto-optimal modules for delayed product differentiation

DOI10.1016/j.ejor.2009.02.013zbMath1177.90136OpenAlexW2102825558MaRDI QIDQ1044146

Zhe Song, Andrew Kusiak

Publication date: 10 December 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2009.02.013

zbMATH Keywords

multi-objective optimizationdata miningmodularityevolutionary computationsdelayed product differentiationmass customization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Production models (90B30) Theory of data (68P99)

Related Items (2)

Minimizing the area of a Pareto confidence region ⋮ Optimal testing strategies in overlapped design process

Cites Work

• Unnamed Item
• A queueing model of delayed product differentiation
• Dynamic programming for delayed product differentiation.
• Commonality and postponement in multistage assembly systems
• Modeling and analysis of build-to-order supply chains
• Managing Broader Product Lines through Delayed Differentiation Using Vanilla Boxes
• Inventory and Production Decisions for an Assemble-to-Order System with Uncertain Demand and Limited Assembly Capacity
• A Greedy Heuristic for the Set-Covering Problem
• Product Variety and Manufacturing Performance: Evidence from the International Automotive Assembly Plant Study
• Modelling the Costs and Benefits of Delayed Product Differentiation
• Introduction to evolutionary computing

This page was built for publication: Mining Pareto-optimal modules for delayed product differentiation