A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
type: Item
instance of: scholarly article
title: A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
zbMATH Open document ID: 1123.90041
author: Chaoyong Zhang
author: Peigen Li
author: Zailin Guan
author: Yun-Qing Rao
published in: Computers \& Operations Research
publication date: 2007-06-04T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5161103
zbMATH Keywords: job shop scheduling problem
zbMATH Keywords: makespan
zbMATH Keywords: heuristic
zbMATH Keywords: tabu search
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: j.cor.2005.12.002
OpenAlex ID: W2036942713
cites work: An Algorithm for Solving the Job-Shop Problem
cites work: A branch and bound algorithm for the job-shop scheduling problem
cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling
cites work: A genetic algorithm for the job shop problem
cites work: Job Shop Scheduling by Simulated Annealing
cites work: Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
cites work: A Fast Taboo Search Algorithm for the Job Shop Problem
cites work: Job Shop Scheduling by Local Search
cites work: The job shop scheduling problem: Conventional and new solution techniques
cites work: Deterministic job-shop scheduling: Past, present and future
cites work: Future paths for integer programming and links to artificial intelligence
cites work: Applying tabu search to the job-shop scheduling problem
cites work: Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Q4354785
cites work: Guided local search with shifting bottleneck for job shop scheduling
cites work: Q4495197
cites work: New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
cites work: Benchmarks for shop scheduling problems
cites work: A tabu search method guided by shifting bottleneck for the job shop scheduling problem
cites work: An experimental analysis of local minima to improve neighbourhood search.
DOI: 10.1016/J.COR.2005.12.002
description: scientific article; zbMATH DE number 5161103