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

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

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

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 searchmakespanheuristicjob shop scheduling problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

A hybrid evolutionary algorithm to solve the job shop scheduling problem ⋮ An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem ⋮ A tabu search/path relinking algorithm to solve the job shop scheduling problem ⋮ A robust parameter design for multi-response problems ⋮ A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem ⋮ An effective new island model genetic algorithm for job shop scheduling problem ⋮ Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements ⋮ Hybrid genetic algorithm with multiparents crossover for job shop scheduling problems ⋮ Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation ⋮ A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems ⋮ A hybrid multiobjective evolutionary approach for flexible job-shop scheduling problems ⋮ Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling ⋮ A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities ⋮ An asynchronous parallel disassembly planning based on genetic algorithm ⋮ An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling ⋮ GA-ACO in Job-Shop Schedule Problem Research

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