A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
From MaRDI portal
Publication:883284
DOI10.1016/J.COR.2005.12.002zbMATH Open1123.90041OpenAlexW2036942713MaRDI QIDQ883284FDOQ883284
Yun-Qing Rao, Chaoyong Zhang, Zailin Guan, Peigen Li
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
Recommendations
- A very fast TS/SA algorithm for the job shop scheduling problem
- Applying tabu search to the job-shop scheduling problem
- Improved taboo search algorithm for Job Shop scheduling problems
- An tentative taboo search algorithm for job shop scheduling
- A tabu search/path relinking algorithm to solve the job shop scheduling problem
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- Future paths for integer programming and links to artificial intelligence
- Tabu Search—Part I
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Applying tabu search to the job-shop scheduling problem
- Job Shop Scheduling by Simulated Annealing
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Benchmarks for shop scheduling problems
- A branch and bound algorithm for the job-shop scheduling problem
- Guided local search with shifting bottleneck for job shop scheduling
- An Algorithm for Solving the Job-Shop Problem
- Tabu Search—Part II
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
- The job shop scheduling problem: Conventional and new solution techniques
- Deterministic job-shop scheduling: Past, present and future
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- Job Shop Scheduling by Local Search
- A genetic algorithm for the job shop problem
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem
- An experimental analysis of local minima to improve neighbourhood search.
- Title not available (Why is that?)
Cited In (26)
- GA-ACO in Job-Shop Schedule Problem Research
- An tentative taboo search algorithm for job shop scheduling
- Problem difficulty for tabu search in job-shop scheduling
- A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities
- A robust parameter design for multi-response problems
- Minimizing the expected maximum lateness for a job shop subject to stochastic machine breakdowns
- An asynchronous parallel disassembly planning based on genetic algorithm
- An efficient tabu search neighborhood based on reconstruction strategy to solve the blocking job shop scheduling problem
- A tabu search/path relinking algorithm to solve the job shop scheduling problem
- A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem
- An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem
- New and ``stronger job-shop neighbourhoods: A focus on the method of Nowicki and Smutnicki (1996)
- A hybrid evolutionary algorithm to solve the job shop scheduling problem
- Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem
- Tabu Search Algorithm with Neural Tabu Mechanism for the Cyclic Job Shop Problem
- An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem
- Hybrid genetic algorithm with multiparents crossover for job shop scheduling problems
- An effective new island model genetic algorithm for job shop scheduling problem
- Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements
- 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
- Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling
- A very fast TS/SA algorithm for the job shop scheduling problem
- A hybrid multiobjective evolutionary approach for flexible job-shop scheduling problems
- An advanced tabu search algorithm for the job shop problem
Uses Software
This page was built for publication: A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q883284)
