Attribute-Based Multi-Filter Bloom Tabu Search for Evaluation-Limited Flexible Flowshop Scheduling

DOI

10.2991/978-94-6239-823-8_8How to use a DOI?

Keywords

tabu search; Bloom filter; Attribute-based tabu; Multi-filter tabu; flexible flowshop scheduling; discrete-event simulation

Abstract

Tabu search relies on memory to prevent cycling and encourage the exploration of new regions of the search space. In many implementations, however, tabu memory is treated mainly as an implementation detail. Classical tabu lists store complete solutions or moves and identify only exact repetitions. For large combinatorial problems, this may require substantial memory and comparison effort, while still failing to recognize different encodings that produce similar schedules after decoding.

We propose an alternative tabu-memory scheme that combines exact solution information with domain-specific attributes. These attributes may describe permutation fragments, assignment patterns, temporal relations, or aggregated features derived from processing times, setup times, transfer times, and due dates. Each attribute type is stored in a separate Bloom filter, forming a compact multi-filter structure with bounded memory use and constant-time membership queries.

The proposed method extends tabu memory beyond exact repetition detection. A candidate may be rejected before simulation when several of its attributes match patterns observed in previously visited solutions. The degree of generalization can be controlled through the selected attributes, quantization rules, hashing policies, and the threshold used to combine filter matches.

We evaluate the method on permutation-based scheduling problems with complex constraints and simulation-based objective evaluation. The results show that attribute-based Bloom filters reduce the number of costly evaluations in every reported case, while maintaining competitive solution quality in several settings. These findings support treating tabu memory as a configurable search policy based on solution attributes, rather than only as a cache of previously visited solutions.

Copyright

© 2026 The Author(s)

Open Access

Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 4.0 International License (http://creativecommons.org/licenses/by-nc/4.0/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.

Download article (PDF)

TY  - CONF
AU  - Levente Áron Fazekas
AU  - Károly Nehéz
PY  - 2026
DA  - 2026/11/04
TI  - Attribute-Based Multi-Filter Bloom Tabu Search for Evaluation-Limited Flexible Flowshop Scheduling
BT  - Proceedings of the Innovation in Engineering Education 2026 Conference (IEE 2026)
PB  - Atlantis Press
SP  - 85
EP  - 97
SN  - 2667-128X
UR  - https://doi.org/10.2991/978-94-6239-823-8_8
DO  - 10.2991/978-94-6239-823-8_8
ID  - Fazekas2026
ER  -