Dynamic programming for delayed product differentiation.

DOI10.1016/S0377-2217(03)00018-3zbMath1045.90023OpenAlexW2076133803MaRDI QIDQ1426701

Wen-Pai Wang, Hsin-Wei Hsu

Publication date: 15 March 2004

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00018-3

zbMATH Keywords

Dynamic programmingDemand uncertaintyDifferentiation pointProduct proliferation

Mathematics Subject Classification ID

Production models (90B30) Dynamic programming (90C39)

Related Items (6)

Modeling and analysis of build-to-order supply chains ⋮ A novel fuzzy mathematical model for an integrated supply chain planning using multi-objective evolutionary algorithm ⋮ Implementation of delayed differentiation in batch process industries: a standardization problem ⋮ A partial-postponement decision cost model ⋮ Mining Pareto-optimal modules for delayed product differentiation ⋮ Limitations of learning in automata-based systems

Cites Work

• Unnamed Item
• Supply chain partnerships: Opportunities for operations research
• The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming
• Two-machine flowshop scheduling with availability constraints
• Determination of a disassembly strategy
• A new dynamic programming formulation of (n x m) flowshop sequencing problems with due dates
• Modelling the Costs and Benefits of Delayed Product Differentiation
• Effective Inventory and Service Management Through Product and Process Redesign

This page was built for publication: Dynamic programming for delayed product differentiation.