Abstracts - faqs.org

Abstracts

Business, general

Search abstracts:
Abstracts » Business, general

A transportation problem in which costs depend on the order of arrival

Article Abstract:

A problem is developed which uses supplied item travel time averages to determine the 'cost' of satisfying the demand at a particular location. Items that arrive first receive the greatest weight, and decreasing weights are given to each succeeding item. An equivalent transportation problem is used for problems with a known demand. If the demand is stochastic a transportation problem whose aim is to minimize the sum of a linear function is used. The function is linearized by substituting the product and a linear term for the convex function.

Author: Denardo, Eric V., Rothblum, Uriel G., Swersey, Arthur J.
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


A dynamic programming approach to stochastic assembly line balancing

Article Abstract:

Two dynamic programming algorithms are developed for a problem involving the minimization of the number of needed workstations for an assembly line when processing times are normally distributed, independent random variables. The algorithms are based on the works of Held et al. (1963) and Kao (1976), and results indicate that they are more efficient than the alternative dynamic programming approach suggested by Henig (1986).

Author: Carraway, Robert L.
Publisher: Institute for Operations Research and the Management Sciences
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1989
Production control, Assembly-line balancing

User Contributions:

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

CAPTCHA


Optimally balancing large assembly lines with 'FABLE'

Article Abstract:

An algorithm for optimally balancing assembly lines is presented. The Fast Algorithm for Balancing Lines Effectively (FABLE) obtains optimal solutions for balancing ten lines with 1,000 tasks each. FABLE is a branch and bound algorithm that uses a minimal amount of computer time and a small amount of computer time.

Author: Johnson, Roger V.
Publisher: Institute for Operations Research and the Management Sciences
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1988
Usage, Branch and bound algorithms

User Contributions:

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

CAPTCHA


Subjects list: Research, Management science, Stochastic analysis, Scheduling (Management), Dynamic programming
Similar abstracts:
  • Abstracts: From stationery to express speed. Meet the chairman of the surf board. BHP tries to squeeze its iron lemon both ways
  • Abstracts: Australia's best value in chief executives. Oil-shale twins scramble to keep the dream alive. Australia grows with the billionaires club
  • Abstracts: Managerial perceptions of employee commitment to the organization. Effects of gender on self- and supervisory ratings
  • Abstracts: Alternative explanations of union wage concessions. Systems of employee voice: theoretical and empirical perspectives
  • Abstracts: An evaluation of AICPA tests for predicting the performance of accounting majors. The information in governmental annual reports: a contemporaneous price reaction approach
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.