A tabu search/path relinking algorithm to solve the job shop scheduling problem
From MaRDI portal
Publication:337272
DOI10.1016/j.cor.2014.08.006zbMath1348.90298arXiv1402.5613OpenAlexW2035982916MaRDI QIDQ337272
Bo Peng, Zhipeng Lü, Cheng, T. C. Edwin
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.5613
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (13)
Multi-start iterated tabu search for the minimum weight vertex cover problem ⋮ Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search ⋮ A hybrid metaheuristic algorithm to optimise a real-world robotic cell ⋮ A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem ⋮ Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements ⋮ A neighborhood for complex job shop scheduling problems with regular objectives ⋮ Matching formulation of the staff transfer problem: meta-heuristic approaches ⋮ Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking ⋮ Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times ⋮ Effective metaheuristic algorithms for the minimum differential dispersion problem ⋮ The job shop scheduling problem with convex costs ⋮ Hybrid social spider optimization algorithm with differential mutation operator for the job-shop scheduling problem ⋮ A matheuristic for the generalized order acceptance and scheduling problem
Uses Software
Cites Work
- Solving job shop scheduling problems utilizing the properties of backbone and ``big valley
- An algorithm for the job shop scheduling problem based on global equilibrium search techniques
- A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
- A new hybrid genetic algorithm for job shop scheduling problem
- Solving the serial batching problem in job shop manufacturing systems
- A very fast TS/SA algorithm for the job shop scheduling problem
- An advanced tabu search algorithm for the job shop problem
- A computational study of shifting bottleneck procedures for shop scheduling problems
- Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
- Combining Constraint Programming and Local Search for Job-Shop Scheduling
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
- A Computational Study of the Job-Shop Scheduling Problem
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- A Fast Taboo Search Algorithm for the Job Shop Problem
- An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling
This page was built for publication: A tabu search/path relinking algorithm to solve the job shop scheduling problem
