Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Restricted neighborhood in the tabu search for the flowshop problem

Article Abstract:

A proposed algorithm is designed to minimixe total weighted tardiness of premutation flowshop tasks and uses a heuristic program based on the tabu search method. The method presents a feasible solution and analyzes the permutations the entire restricted neighborhood within the range of this solution. A decrease in computational costs permits the on-line dynamic scheduling systems becomes possible with a reduction in computational costs.

Author: Adenso-Diaz, Belarmino
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1992
Linear programming, Software, Online searching

User Contributions:

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

CAPTCHA


A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem

Article Abstract:

A branch-and-bound procedure for minimizing the makespan in multiple-machine permutation flowshop scheduling problems (FSP) was developed. The algorithm, which employs membership functions to perform a fuzzy approximation based on a new dominance relation, was evaluated via benchmark tests and Monte Carlo simulations. The results showed its suitability for FSP problems with up to 1,000 jobs on systems with less than six machines.

Author: Cheng, Jinliang, Kise, Hiroshi, Matsumoto, Hironori
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1997
Production Planning & Control, Manufacturing processes, Manufacturing, Production control, Branch and bound algorithms

User Contributions:

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

CAPTCHA


An SA/TS mixture algorithm for the scheduling tardiness problem

Article Abstract:

A combined application of simulated annealing (SA) and Tabu search (TS) for minimizing delay in job sequencing was proven to be valid in tests undertaken on 720 problems with 10 to 50 jobs and with 5 to 20 machines. These two topologies have individually proven to perform well in some problems. The algorithm, which integrates SA and TS, is aimed at minimizing costs stemming from delays in dispatching.

Author: Adenso-Diaz, Belarmino
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
Models, Search theory, Heuristic programming, Simulated annealing (Mathematics)

User Contributions:

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

CAPTCHA


Subjects list: Research, Scheduling (Management)
Similar abstracts:
  • Abstracts: Pains of indigestion; Indonesian food firm faces debt problems. Double-edged sword
  • Abstracts: A survey of algorithms for the generalized assignment problem. The capacitated distribution and waste disposal problem
  • Abstracts: All aboard: new Singapore-Bangkok train goes for the glitz. The Indian share: Malaysia deepens probe of telecom privatisation
  • Abstracts: Share the wealth: India's Vysya places stock to ward off predators. Insatiable demand
  • Abstracts: Satisfaction with space around the home on large private sector estates: lessons from surveys in Southern England and South Wales, 1985-89
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.