Abstracts - faqs.org

Abstracts

Business, general

Search abstracts:
Abstracts » Business, general

Determining optimal reorder intervals in capacitated production-distribution systems

Article Abstract:

Previous management researchers have formulated a large scale, non-linear, integer programming model to solve the problem of determining intervals in complex production-distribution environments. This model and the conditions that characterize the solution are reviewed. Optimal partition of nodes in the network are shown to be invariant to an an arbitrary scaling of cost parameters. Two capacitated versions of the integer programming model are examined: single constrained work center model, and multiple constrained work centers. The invariance corollary is a simple, closed-form solution for single constraint problems. A Lagrange multiplier method which exploits the invariance corollary is developed to solved multiple constraint problems.

Author: Muckstadt, John A., Jackson, Peter L., Maxwell, William L.
Publisher: Institute for Operations Research and the Management Sciences
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1988

User Contributions:

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

CAPTCHA


Stock allocation in a two-echelon distribution system or 'what to do until your ship comes in'

Article Abstract:

The problem of stock allocation in a two-echelon distribution system for a consumable item is discussed. The focus is on a single order cycle of a warehouse. The warehouse serves N retailers, and only shipments from the warehouse to the retailers are allowed during the cycle. Both the exact cost model and a computationally tractable approximate cost model are developed for the case of identical retailers under a ship-up-to-S allocation policy. The benefits of centralizing at least part of the total system stock are empirically demonstrated.

Author: Jackson, Peter L.
Publisher: Institute for Operations Research and the Management Sciences
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1988
Management, Distribution of goods, Distribution (Commerce), Inventories

User Contributions:

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

CAPTCHA


Batching to minimize flow times on parallel heterogeneous machines

Article Abstract:

An algorithm is developed for determining optimal scheduling in a single product, multiple machine work area. Flow times are affected by both processing batch sizes and the work allocation to machines. A closed-form solution is presented which can be used as a heuristic loading rule in certain environments. The work center's optimal flow time is solely dependent on the center's total processing rate.

Author: Rummel, Jeffrey L., Karmarkar, Uday S., Dobson, Gregory
Publisher: Institute for Operations Research and the Management Sciences
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1989
Operations research

User Contributions:

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

CAPTCHA


Subjects list: Research, Management science, Scheduling (Management), Economic lot size
Similar abstracts:
  • Abstracts: An optimal design problem for limited processor sharing systems. Reversibility of tandem blocking queueing systems
  • Abstracts: The maximal covering location problem with capacities on total workload. The siting of emergency service facilities with workload capacities and backup service
  • Abstracts: Rules for residential interest changed. New rules for S corporations. New automobile substantiation rules
  • Abstracts: The role of incubators in small business planning. Screening practices of new business incubators: the evaluation of critical success factors
  • Abstracts: Cooperation, opportunism, and the invisible hand: implications for transaction cost theory. Differentiation versus low cost or differentiation and low cost: a contingency framework
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.