A fast tabu search algorithm for the permutation flow-shop problem

Article Abstract:

A new approximation algorithm based on the tabu search technique has been developed. The algorithm finds better solutions and runs in a shorter time compared to other approximation techniques through the use of certain block properties. It can be easily implemented and easily tuned, although default values of tuning parameters are recommended. The method has been subjected to computational experiments involving up to 500 jobs and 20 machines and showed robust numerical properties.

Search theory, Shop mathematics

---

The flow shop with parallel machines: a tabu search approach

Article Abstract:

TS algorithm proves to be a fast and effective approximation algorithm for the scheduling problem called the flow shop with parallel machines (FSPM). The algorithm, which is based on a tabu search technique, is faster compared to other traditional approches as evidenced by the computational experiments that involved up to 3000 operations and 60 machines.

Operations Research, Management science, Models, Scheduling (Management), Algorithms

---

Similar abstracts:

• Abstracts: Scatter search for the vehicle routing problem with time windows
• Abstracts: Scatter search for the vehicle routing problem with time windows. part 2 A variable neighborhood decomposition search method for supply chain management planning problems
• Abstracts: A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines. Scatter Search in software testing, comparison and collaboration with Estimation of Distribution Algorithms

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.