Abstracts - faqs.org

Abstracts

Business, general

Search abstracts:
Abstracts » Business, general

Optimal and heuristic procedures for component lot-splitting in multi-stage manufacturing systems

Article Abstract:

A multi-stage lot-sizing problem is formulated for situations in which the production of items is non-instantaneous and the demand for the end item is constant. Heuristic and optimal problem-solving procedures are developed and compared. Considerable cost savings and inventory reductions can be realized, if the component lot-splitting approach is used in favorable multi-stage manufacturing environments. The heuristic procedure is recommended when the number of items in the manufacturing environment is large or the inventory costs cannot be easily estimated.

Author: Moily, Jaya P.
Publisher: Institute for Operations Research and the Management Sciences
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1986
Manufacturing processes, Manufacturing, Mathematical optimization, Optimization theory, Heuristic programming

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Piecewise loglinear estimation of efficient production surfaces

Article Abstract:

The basic properties postulated for production possibility sets are used to derive linear programming formulations, which are in turn used in loglinear estimations of efficient production surfaces. This approach allows increasing marginal products to be identified and permits estimation of S-shaped production functions. Methods for estimating production inefficiencies, rates of substitution, returns to scale, and optimal scale size are also described. A simulation study that demonstrates the usefulness of this estimation method is included.

Author: Banker, Rajiv D., Maindiratta, Ajay
Publisher: Institute for Operations Research and the Management Sciences
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1986
Linear programming

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


The optimality of (s, S) policies for a stochastic inventory problem with proportional and lump-sum penalty cost

Article Abstract:

A single-product, multi-period inventory problem is discussed. The penalty cost in this problem is in two portions, one independent of the size of the shortage, and the other linear in the size of the shortage. The expected total cost function for all non-increasing demand density functions is K-convex. As a result, the optimal policy for the n-period problem is (s, S).

Author: Aneja, Yash, Noori, Hamid
Publisher: Institute for Operations Research and the Management Sciences
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1987
Stochastic analysis

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Subjects list: Research, Management science, Models, Usage, Production management, Inventory control
Similar abstracts:
  • Abstracts: Optimal investment in product-flexible manufacturing capacity. Quality improvement and learning in productive systems
  • Abstracts: A synthesis of decision models for tool management in automated manufacturing. Minimizing mean squared deviation of completion times about a common due date
  • Abstracts: Robust scheduling to hedge against processing time uncertainty in single-stage production
  • Abstracts: The need for middle-out development of marketing strategy. Managerial perceptions of marketing planning. The effect of decision-making styles and contextual experience on executives' descriptions of organizational problem formulation
  • Abstracts: A note on variance reducing group maintenance policies. (m, T) group maintenance policies. Subjective probability and the prisoner's dilemma
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.
Some parts © 2025 Advameg, Inc.