Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Sequential location problems

Article Abstract:

Sequential location models are operational research paradigms wherein facilities enter the market in a sequential manner. The main components of competitive location models are space, the number of decision makers or players, pricing policies and customer distribution and behavior. A survey of individual location models is conducted based on the space the facilities are located in, with emphasis on the changes that occur when assumptions are dropped or replaced by others.

Author: Laporte, Gilbert, Eiselt, H.A.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1997
Research, Factories, Location, Industrial locations, Industrial location, Sequential analysis

User Contributions:

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

CAPTCHA


Branch-and-bound algorithms for the multi-product assembly line balancing problem

Article Abstract:

A modification of the branch-and-bound algorithm for the tree assembly line balancing problem in flexible manufacturing systems for several products is proposed. The model has an improved lower-bounding procedure and a stronger partitioning scheme. Application of the model allows the minimization of the number of work stations needed to manufacture a variety of products requiring sequential nonpreemptive tasks, some of which are shared by different products.

Author: Laporte, Gilbert, Berger, Hana, Bourjolly, Jean-Marie
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1992
Models, Assembly-line balancing

User Contributions:

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

CAPTCHA


On a pattern sequencing problem to minimize the maximum number of open stacks

Article Abstract:

A branch and bound approach is proposed to address the problem of the minimization of open stack problem (MOSP). The method, which utilizes a greedy type strategy to choose the subsequent node to branch, aims to lessen the maximum number of open stacks during a production run. However, the method is computationally difficult to effect.

Author: Yanasse, Horacio Hideki
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1997
Production Planning & Control, Planning, Production management, Production control

User Contributions:

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

CAPTCHA


Subjects list: Analysis, Usage, Flexible manufacturing systems, Branch and bound algorithms
Similar abstracts:
  • Abstracts: Undergraduate industrial marketing: content and methods. Outdoor advertising for business markets. Teleprospecting: an approach for qualifying accounts
  • Abstracts: Implications of single vs. multiple buying sources. Distributor image and marketing strategy. Industrial distribution options: trade-offs to consider
  • Abstracts: Ambivalent campaign: praise of Vietnam is mixed with fear of possible explosion. Building a rapport
  • Abstracts: Transboundary air pollution in Europe: an interactive multicriteria tradeoff analysis. Interactive multiobjective analysis and assimilative capacity-based ocean disposal decisions
  • Abstracts: Behind closed doors. Sprinting to the forefront: shoemaker Yue Yuen is a Taiwanese success in China. Once spurned
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.