Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

A linear approximation model for the parameter design problem

Article Abstract:

A nonlinear programming (NLP) model based on the Taylor series expansion of a given function was utilized to generate solutions for the parameter design problem (PDP). The simple constrained NLP model for PDP can be applied in cases involving unknown transfer functions including other design considerations involving technical requirements and costs. Furthermore, multi-objective optimization techniques can be applied in cases involving more than two objective functions.

Author: Fathi, Yahya
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1997
Operations Research, Models, Manufacturing processes, Manufacturing, Problem solving, Nonlinear programming

User Contributions:

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

CAPTCHA


Heuristic methods for gang-rip saw arbor designs

Article Abstract:

A study examines the problems of design and scheduling of arbors for a computer assisted gang-rip saw system used for processing lumber. Several heuristic procedures are developed as solutions based on the principles of local improvement, simulated annealing and genetic algorithms.

Author: Fathi, Yahya, Aksakalli, Vural
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2004
Methods, Study and teaching, Computational complexity, Computational complexity (Machine theory), Heuristic, Combinatorial optimization, Optimization theory, Mathematical programming, Heuristics (Psychology)

User Contributions:

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

CAPTCHA


A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities

Article Abstract:

The problem of scheduling N jobs on parallel machines on L successive stages with limited buffer capacities between stages is investigated. With the main aim to find a schedule that would minimize the makesman, a tabu search algorithm is developed.

Author: Fathi, Yahya, Wardono, Bagas
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2004
Evaluation, Algorithms, Algorithm

User Contributions:

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

CAPTCHA


Subjects list: Analysis
Similar abstracts:
  • Abstracts: A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem. A note of the approximation of the asymmetric traveling salesman problem
  • Abstracts: A Steiner arborescence model for the feeder reconfiguration in electric distribution networks. Solving a fuel delivery problem by heuristic and exact approaches
  • Abstracts: Comrades in arms; Russian rapprochement could boost China's clout. Offshoring: don't fight it
  • Abstracts: Crooked cops. Impotent potions: 'Anti-Aids' elixirs confound regulators and threaten lives in China. The guardian angel finally had enough
  • Abstracts: Working together is best for all. 3-D thermoclines. Back-down on crab sharing
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.