A neuro-tabu search heuristic for the flow shop scheduling problem
From MaRDI portal
Publication:1885991
DOI10.1016/S0305-0548(03)00169-2zbMath1068.68040MaRDI QIDQ1885991
R. Shankar, Prem Vrat, Maghsud Solimanpur
Publication date: 12 November 2004
Published in: Computers \& Operations Research (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (7)
A multi-objective particle swarm for a flow shop scheduling problem ⋮ A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation ⋮ An improved NEH heuristic to minimize makespan in permutation flow shops ⋮ Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm ⋮ No-wait flow shop scheduling using fuzzy multi-objective linear programming ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ Tabu Search Algorithm with Neural Tabu Mechanism for the Cyclic Job Shop Problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- Some efficient heuristic methods for the flow shop sequencing problem
- A new heuristic method for the flow shop sequencing problem
- A fast tabu search algorithm for the permutation flow-shop problem
- A tabu search approach for the flow shop scheduling problem
- A genetic algorithm for flowshop sequencing
- A novel chaotic search for quadratic assignment problems
- Future paths for integer programming and links to artificial intelligence
- A new heuristic for the n-job, M-machine flow-shop problem
- Benchmarks for basic scheduling problems
- Optimal two- and three-stage production schedules with setup times included
- Tabu Search—Part I
- Tabu Search—Part II
- An Evaluation of Flow Shop Sequencing Heuristics
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
- Defining tabu list size and aspiration criterion within tabu search methods
This page was built for publication: A neuro-tabu search heuristic for the flow shop scheduling problem