A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem

DOI10.1016/j.cor.2005.12.002zbMath1123.90041MaRDI QIDQ883284

Yun-Qing Rao, Chaoyong Zhang, Peigen Li, Zailin Guan

Publication date: 4 June 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.12.002

zbMATH Keywords

tabu search; makespan; heuristic; job shop scheduling problem

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Related Items

A robust parameter design for multi-response problems

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• The job shop scheduling problem: Conventional and new solution techniques
• Benchmarks for shop scheduling problems
• A branch and bound algorithm for the job-shop scheduling problem
• A genetic algorithm for the job shop problem
• An experimental analysis of local minima to improve neighbourhood search.
• Deterministic job-shop scheduling: Past, present and future
• Future paths for integer programming and links to artificial intelligence
• A tabu search method guided by shifting bottleneck for the job shop scheduling problem
• Applying tabu search to the job-shop scheduling problem
• Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• An Algorithm for Solving the Job-Shop Problem
• Job Shop Scheduling by Simulated Annealing
• Tabu Search—Part I
• Tabu Search—Part II
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
• A Fast Taboo Search Algorithm for the Job Shop Problem
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
• Job Shop Scheduling by Local Search