Tabu Search Algorithm with Neural Tabu Mechanism for the Cyclic Job Shop Problem

DOI10.1007/978-3-319-39384-1_35zbMath1358.90042OpenAlexW2469969153MaRDI QIDQ2814141

Wojciech Bożejko, Andrzej Gnatowski, Teodor Niżyński, Mieczyslaw Wodecki

Publication date: 17 June 2016

Published in: Artificial Intelligence and Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-39384-1_35

zbMATH Keywords

schedulingtabu searchdiscrete optimization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Cyclic flow shop scheduling problem with two-machine cells

Uses Software

• OR-Library

Cites Work

• Some efficient heuristic methods for the flow shop sequencing problem
• A tabu search approach for the flow shop scheduling problem
• Flow-shop problems with intermediate buffers
• Future paths for integer programming and links to artificial intelligence
• A neuro-tabu search heuristic for the flow shop scheduling problem
• On the theoretical properties of swap multimoves
• A Fast Taboo Search Algorithm for the Job Shop Problem

This page was built for publication: Tabu Search Algorithm with Neural Tabu Mechanism for the Cyclic Job Shop Problem