Abstracts - faqs.org

Abstracts

Business, general

Search abstracts:
Abstracts » Business, general

Optimal production policies for multi-stage systems with setup costs and uncertain capacities

Article Abstract:

A production planning model is developed for a multi-stage serial production system with uncertain aggregate production capacity at each stage. The study seeks to determine the relation between capacity uncertainties and production decisions in such a setting. A simple two-critical number production policy for each stage is demonstrated to be optimal. It is shown that, when the available input goes beyond the lower critical number, there is a tendency to bolster production as much as possible but not to the point of exceeding the upper critical number. The critical numbers for successive stages are found to be monotonic, which suggests that the lower critical numbers can be used to effectively control production for all the stages, except the first stage.

Author: Hwang, Juhwen, Singh, Medini R.
Publisher: Institute for Operations Research and the Management Sciences
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1998
Methods, Management, Manufacturing processes, Manufacturing, Production management, Industrial capacity

User Contributions:

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

CAPTCHA


Optimizing a ring-based private line telecommunication network using Tabu search

Article Abstract:

A study was conducted to analyze the problem of optimizing a ring-based private line telecommunications network. A Tabu search technique was utilized to carry out the analysis. It supported probabilistic move selections, long term memory and candidate list strategies. Moreover, the method integrated hierarchical move evaluation and an elite solution recovery scheme. Computations were carried out on small size random problems and larger problem instances. Results indicated that the Tabu Search heuristic can effectively determine optimal solutions for all test problems which can be solved by a branch-and-cut algorithm. In addition, the algorithm outperforms the best local search heuristic available.

Author: Xu, Jiefeng, Chiu, Steve Y., Glober, Fred
Publisher: Institute for Operations Research and the Management Sciences
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1999
Communications Equipment, Telecommunications Equipment, Communications Equipment Manufacturing, Information Systems & Theory, Research, Telecommunications systems, Design and construction, Algorithms, Telecommunication systems, Heuristic programming

User Contributions:

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

CAPTCHA



Subjects list: Analysis
Similar abstracts:
  • Abstracts: An O(T super 3) algorithm for the economic lot-sizing problem with constant capacities. A min cost flow solution for dynamic assignment problems in networks with storage devices
  • Abstracts: Simulation-based estimation of proportions. A branch and bound procedure for the resource constrained project scheduling problem with discounted cash flows
  • Abstracts: Vector smoothing improves accuracy of item level forecasts. How to prepare forecasts using EDA tools: a hospital-based case study
  • Abstracts: High-end speaker systems bring quality sound to home computers. Microsoft pushing to alter standard for digital TV
  • Abstracts: The don flows again. Vacation reading
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.