A tabu search method guided by shifting bottleneck for the job shop scheduling problem
From MaRDI portal
Publication:1969832
DOI10.1016/S0377-2217(99)00158-7zbMath0953.90026OpenAlexW2119641336MaRDI QIDQ1969832
Emanuela Merelli, Ferdinando Pezzella
Publication date: 19 March 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00158-7
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)
Related Items
An improved shifting bottleneck procedure for the job shop scheduling problem, Problems of discrete optimization: challenges and main approaches to solve them, Multicriteria scheduling using fuzzy theory and tabu search, A very fast TS/SA algorithm for the job shop scheduling problem, 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, Application of quantum approximate optimization algorithm to job shop scheduling problem, Multi-population interactive coevolutionary algorithm for flexible job shop scheduling problems, A general approach for optimizing regular criteria in the job-shop scheduling problem, Tabu search algorithms for minimizing total completion time on a single machine with an actual time-dependent learning effect, Augmented neural networks for task scheduling., Multiple colony ant algorithm for job-shop scheduling problem, Ant colony optimization combined with taboo search for the job shop scheduling problem, An advanced tabu search algorithm for the job shop problem, No-wait job shop scheduling: tabu search and complexity of subproblems, A PARTICLE SWARM OPTIMIZATION-BASED ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEMS, Solving flexible job-shop scheduling problem using gravitational search algorithm and colored Petri net, On single-walk parallelization of the job shop problem solving algorithms, Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem, Minimizing L max for large-scale, job-shop scheduling problems, Double layer ACO algorithm for the multi-objective FJSSP, Hybrid rollout approaches for the job shop scheduling problem, An tentative taboo search algorithm for job shop scheduling, A knowledge-based evolutionary strategy for scheduling problems with bottlenecks
Uses Software
Cites Work
- A block approach for single-machine scheduling with release dates and due dates
- The one-machine sequencing problem
- Future paths for integer programming and links to artificial intelligence
- Benchmarks for basic scheduling problems
- 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
- A Computational Study of the Job-Shop Scheduling Problem
- The Complexity of Flowshop and Jobshop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
