A neuro-tabu search heuristic for the flow shop scheduling problem
type: Item
instance of: scholarly article
title: A neuro-tabu search heuristic for the flow shop scheduling problem
zbMATH Open document ID: 1068.68040
DOI: 10.1016/S0305-0548(03)00169-2
author: Prem Vrat
author: Ravi Shankar
author: Maghsud Solimanpur
published in: Computers \& Operations Research
publication date: 2004-11-12T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 2115380
zbMATH Keywords: Scheduling
zbMATH Keywords: Flow shop scheduling
zbMATH Keywords: Tabu search
zbMATH Keywords: Exponential tabu search
zbMATH Keywords: Neural networks
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
cites work: A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
cites work: An Evaluation of Flow Shop Sequencing Heuristics
cites work: Q3670909
cites work: Some efficient heuristic methods for the flow shop sequencing problem
cites work: A new heuristic method for the flow shop sequencing problem
cites work: A new heuristic for the n-job, M-machine flow-shop problem
cites work: The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
cites work: A fast tabu search algorithm for the permutation flow-shop problem
cites work: A tabu search approach for the flow shop scheduling problem
cites work: Future paths for integer programming and links to artificial intelligence
cites work: Q4354785
cites work: Defining tabu list size and aspiration criterion within tabu search methods
cites work: Exponential and chaotic neurodynamical tabu searches for quadratic assignment problems
cites work: A novel chaotic search for quadratic assignment problems
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: A genetic algorithm for flowshop sequencing
cites work: Benchmarks for basic scheduling problems
description: scientific article; zbMATH DE number 2115380