Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: algorytm heurystyczny hybrydowy

Sortuj według:

Ogranicz wyniki do:

A new approach to job shop-scheduling problem

Mahdavinejad R. A.

Journal of Achievements in Materials and Manufacturing Engineering

2010

Vol. 41, nr 1-2

200-206

Purpose: Ant colony optimization algorithm, not only promote the ability of this proposed algorithm, but also de- creases the total working time because of decreasing in setup times and modifying the working production line. Design/methodology/approach: In this paper, single-processors jobshop scheduling problems are solved by a heuristic algorithm based on the hybrid of priority dispatching rules according to an ant colony optimization algorithm. Findings: The objective function is to minimize the makespan, i.e. total completion time, in which a simultanous presence of various kinds of ferons is allowed. The process of finding the best solution will be improved by using the suitable hybrid of priority dispatching rules. Research limitations/implications: By solving some problems as samples (i.e. Fisher’s & Tomson’s problems), this algorithm is compared with the others. Practical implications: The utilization of one processor instead of multiple one, merging the industrial control network layer into system management layer and omission of processor execution layer in each axis and optimized using of multi-tasking capability of processor. Originality/value: The results show that when the size of the problem becomes larger, the deviation from lower limit increases, but its rate decreases with the size of the problems, so that it reaches to its limit.