Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
From MaRDI portal
Recommendations
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Applying tabu search to the job-shop scheduling problem
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem
- An tentative taboo search algorithm for job shop scheduling
- Tabu search for the job-shop scheduling problem with multi-purpose machines
Cited in
(80)- Hybrid rollout approaches for the job shop scheduling problem
- An integrated tabu search algorithm for the lot streaming problem in job shops
- The job shop scheduling problem: Conventional and new solution techniques
- Parallel branch-and-bound methods for the job-shop scheduling problem
- The life span method -- a new variant of local search
- Benchmarks for shop scheduling problems
- Unrelated parallel machine scheduling using local search
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
- A hierarchical approach for the FMS scheduling problem
- A hybrid genetic algorithm for the open shop scheduling problem
- A large step random walk for minimizing total weighted tardiness in a job shop
- Decomposition methods for reentrant flow shops with sequence-dependent setup times
- Decomposition methods for large job shops
- A novel chaotic search for quadratic assignment problems
- Performance evaluation of a parallel tabu search task scheduling algorithm
- A tabu search approach to machine scheduling
- 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
- Deterministic job-shop scheduling: Past, present and future
- Job-shop scheduling with blocking and no-wait constraints
- An improved shifting bottleneck procedure for the job shop scheduling problem
- Adaptive temperature control for simulated annealing: a comparative study
- An improved tabu search approach for solving the job shop scheduling problem with tooling constraints
- Focused simulated annealing search: An application to job shop scheduling
- Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements
- A comparison of local search methods for flow shop scheduling
- Metaheuristics: A bibliography
- Parallel local search
- Evolutionary tabu search for flexible due-date satisfaction in fuzzy job shop scheduling
- Benchmarks for basic scheduling problems
- Routing and scheduling in a flexible job shop by tabu search
- A very fast TS/SA algorithm for the job shop scheduling problem
- A neighborhood for complex job shop scheduling problems with regular objectives
- An advanced tabu search algorithm for the job shop problem
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
- A hybrid genetic algorithm for the job shop scheduling problem
- Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem
- An integrated approach for modeling and solving the scheduling problem of container handling systems
- Applying machine based decomposition in 2-machine flow shops
- Parallel branch-and-bound and parallel PSO algorithms for job shop scheduling problem with blocking
- Job-shop local-search move evaluation without direct consideration of the criterion's value
- A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times
- Instance space analysis and algorithm selection for the job shop scheduling problem
- Flexible job shop problem -- parallel tabu search algorithm for multi-GPU
- A hybrid evolutionary algorithm to solve the job shop scheduling problem
- A tabu search/path relinking algorithm to solve the job shop scheduling problem
- Scatter search with path relinking for the job shop with time lags and setup times
- Solving the job-shop scheduling problem optimally by dynamic programming
- A parallel tabu search for solving the primal buffer allocation problem in serial production systems
- Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation
- A general approach for optimizing regular criteria in the job-shop scheduling problem
- A genetic algorithm methodology for complex scheduling problems
- scientific article; zbMATH DE number 1488092 (Why is no real title available?)
- Proactive release procedures for just-in-time job shop environments, subject to machine failures
- scientific article; zbMATH DE number 2148766 (Why is no real title available?)
- Advanced search techniques for the job shop problem : a comparison
- A new hybrid parallel genetic algorithm for the job-shop scheduling problem
- Combining prospect theory with fuzzy theory to handle disruption in production scheduling
- Improved taboo search algorithm for Job Shop scheduling problems
- An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling
- Evaluating artificial intelligence heuristics for a flexible Kanban system: simultaneous Kanban controlling and scheduling
- An tentative taboo search algorithm for job shop scheduling
- Heuristics from Nature for Hard Combinatorial Optimization Problems
- Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments
- Artificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costs
- Adaptive memory programming: a unified view of metaheuristics
- Fast parallel heuristics for the job shop scheduling problem
- A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems
- A constraint programming-based lower bounding procedure for the job shop scheduling problem
- A speed-up procedure and new heuristics for the classical job shop scheduling problem: a computational evaluation
- Influence of encoding and neighborhood in landscape analysis and tabu search performance for job shop scheduling problem
- A note on ``A constraint programming-based lower bounding procedure for the job shop scheduling problem
- Problem difficulty for tabu search in job-shop scheduling
- A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling
- A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal
- Two-machine flow shop problems with a single server
- A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
- Ant colony optimization combined with taboo search for the job shop scheduling problem
- Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times
- A comparison of problem decomposition techniques for the FAP
This page was built for publication: Parallel Taboo Search Techniques 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 Q4302712)
