A modeling framework for coordinating promotion and production decisions within a firm

Article Abstract:

The benefits of coordinating promotion and production decisions over a finite horizon are evaluated. The problem can be formulated as a mixed integer program which takes into account decisions regarding production levels and promotion timing and levels. Reformulation into a nested longest path problem enables polynomial time approximation using a modeling framework composed of a baseline model and an integrated model, wherein separate and joint consideration, respectively, of the decisions is made. In either model, the objective function involves the maximization of total net profit, which can be accomplished efficiently. Comparison of the total net profit obtained from the two models shows that coordination of decisions in the manufacturing-marketing interface is advisable.

Decision-making, Decision making, Management, Planning, Sales promotions, Production planning

---

The impact of uncertainty on a production line

Article Abstract:

There are two types of uncertainty that characterize multi-stage automatic assembly manufacturing lines: the output rate of each production stage, and the demand rate of the final product. Both uncertainties give rise to problems in production planning. A discrete-time model based on a linear production rule synthesized from the restoration concept of Denardo and Tang (1988) is used to analyze the impact of these uncertainties on the level of production and inventory in order to understand production planning. The linear production rule illustrates a steady state in which can be elucidated the variance of the levels of production and inventory, thus enabling users to analyze the impact of increases in yield rates and reduction in demand.

Research, Manufacturing industry, Manufacturing industries, Assembly-line methods, Assembly lines

---

Reducing separable convex programs with tree constraints

Article Abstract:

A reduction method for solving a group of separable convex programs with tree constraints is presented. The programs can be applied to several areas, including production planning and quality improvement. The reduction method, which involves repeatedly solving simple convex sub-problems, produces an optimal solution to the convex problem. The reduction technique offers an efficient way of solving large-scale convex programs.

Mathematical optimization, Optimization theory, Convex programming, Separable algebras

Similar abstracts:

• Abstracts: A framework for analyzing customer service orientations in manufacturing. Transaction cost analysis of service organization - customer exchange
• Abstracts: A heuristic scheduling policy for multi-item, single-machine production systems with time-varying, stochastic demands
• Abstracts: Marketing-production decisions in an industrial channel of distribution. Competitive strategies for two firms with asymmetric production cost structures
• Abstracts: Finding embedded network rows in linear programs I. extraction heuristics. A modeling language for mathematical programming
• Abstracts: A general theory of network governance: exchange conditions and social mechanisms. The knowledge-based view, nested heterogeneity, and new value creation: Philosophical considerations on the locus of knowledge

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.