An adaptable scheduling algorithm for flexible flow lines
Operations Research
Scheduling flowshops with finite buffers and sequence-dependent setup times
Computers and Industrial Engineering
Hybrid flow shop scheduling: a survey
Computers and Industrial Engineering
A tabu scatter search metaheuristic for the arc routing problem
Computers and Industrial Engineering - Special issue: Focussed issue on applied meta-heuristics
Scheduling with Finite Capacity Input Buffers
Operations Research
Scheduling with Finite Capacity Output Buffers
Operations Research
A very fast Tabu search algorithm for the permutation flow shop problem with makespan criterion
Computers and Operations Research
DNA Sequencing--Tabu and Scatter Search Combined
INFORMS Journal on Computing
An effective hybrid genetic algorithm for flow shop scheduling with limited buffers
Computers and Operations Research
Computers and Operations Research
Computers and Operations Research
Expert Systems with Applications: An International Journal
Self-Optimization module for Scheduling using Case-based Reasoning
Applied Soft Computing
Hi-index | 0.01 |
This paper investigates the hybrid flowshop scheduling with finite intermediate buffers, whose objective is to minimize the sum of weighted completion time of all jobs. Since this problem is very complex and has been proven strongly NP-hard, a tabu search heuristic is proposed. In this heuristic there are two main features. One is that a scatter search mechanism is incorporated to improve the diversity of the search procedure. And the other is that a permutation of N jobs representing their processing order in the first stage instead of a complex complete schedule is used to denote a solution. Computational experiments on randomly generated instances with different structures show that the proposed tabu search heuristic can provide good solutions compared to both the lower bounds and the algorithm proposed for this problem in a lately published literature.