Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Computational performance and efficiency of lower-bound procedures for the dynamic facility layout problem

Article Abstract:

Aclass of lower bounds for the dynamic facility layout problem is presented as an alternative to optimal solutions forthe quadratic assignment problem. Comparison of the relative performance of lower-bound procedures using Gilmore-type bounds, Rosenblatt bounds and probabilistic bounds show that probabilistic bounds result in near-optimal solutions. Gilmore-type bounds are particularly effective for compact layout designs while Rosenblatt bounds are best for evaluating dynamic facility layoutheuristics. Probabilistic bounds perform best with scattered layout designs.

Author: Urban, Timothy L.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1992
Models, Plant layout

User Contributions:

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

CAPTCHA


Inventory models with inventory-level-dependent demand: a comprehensive review and unifying theory

Article Abstract:

The inventory models for products exhibiting an inventory-level-dependent demand (ILDD) rate are reviewed. The two distinct types of inventory control models that reflect the equivalence between the demand rate of retail items and the inventory level are examined.

Author: Urban, Timothy L.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2005
United States, Market information - general, Inventory Control, Inventories, Methods, Supply and demand

User Contributions:

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

CAPTCHA


An optimal piecewise-linear program for the U-line balancing problem with stochastic task times

Article Abstract:

The U-line balancing problem with stochastic task times is examined. A chance-constrained, piecewise-linear, integer program is formulated to find the optimal solution.

Author: Urban, Timothy L., Chiang, Wen-Chyuan
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2006
Europe, Analysis, Usage, Stochastic programming, Assembly-line balancing

User Contributions:

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

CAPTCHA

Similar abstracts:
  • Abstracts: A note on efficient solutions for the linear bilevel programming problem. Investment and harvest strategies of the Finnish forest sector under different forest-tax policies: a differential game approach with computer-based decision aid
  • Abstracts: Investing gets easier. In God they trust: a wave of religiosity sweeps the country
  • Abstracts: Deep in hock. Right place, right time: Marconi uses Portuguese colony for ambitious telecoms strategy
  • Abstracts: Integrating facility layout with process selection and capacity planning. Scheduling flexible flow lines with sequence-dependent setup times
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.