Advertisement
Published in:
1997 | OriginalPaper | Chapter
Approximation Algorithms
Author : Czesław Smutnicki
Published in: Operations Research Proceedings 1996
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
The paper deals with a class of approximation algorithms based on a tabu search technique, recommended for scheduling of a flexible flow line. This line consists of a sequence of processing centres, each center has a number of identical parallel machines, there are intermediate buffers between centers, and parts flow through successive (not necessary all) centers in the same order. Proposed algorithms are fast, easily implementable and have excellent performance verified in computer tests.