An advanced tabu search algorithm for the job shop problem
From MaRDI portal
Publication:2464439
DOI10.1007/s10951-005-6364-5zbMath1154.90479OpenAlexW2087138863MaRDI QIDQ2464439
Czesław Smutnicki, Eugeniusz Nowicki
Publication date: 20 December 2007
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-005-6364-5
Related Items (45)
A multi-objective memetic algorithm for the job-shop scheduling problem ⋮ Job-shop local-search move evaluation without direct consideration of the criterion's value ⋮ A hybrid evolutionary algorithm to solve the job shop scheduling problem ⋮ An integrated search heuristic for large-scale flexible job shop scheduling problems ⋮ Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search ⋮ A tabu search/path relinking algorithm to solve the job shop scheduling problem ⋮ Genetic tabu search for the fuzzy flexible job shop problem ⋮ Scatter search with path relinking for the job shop with time lags and setup times ⋮ A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem ⋮ Mixed integer programming models for job shop scheduling: A computational analysis ⋮ A neighborhood for complex job shop scheduling problems with regular objectives ⋮ Depth-first heuristic search for the job shop scheduling problem ⋮ Scatter search for minimizing weighted tardiness in a single machine scheduling with setups ⋮ Instance space analysis and algorithm selection for the job shop scheduling problem ⋮ A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective ⋮ Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation ⋮ An artificial bee colony algorithm for the job shop scheduling problem with random processing times ⋮ A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems ⋮ A hybrid differential evolution and tree search algorithm for the job shop scheduling problem ⋮ A PMBGA to optimize the selection of rules for job shop scheduling based on the Giffler-Thompson algorithm ⋮ Multipath adaptive tabu search for a vehicle control problem ⋮ A general approach for optimizing regular criteria in the job-shop scheduling problem ⋮ Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis ⋮ A memetic algorithm for restoring feasibility in scheduling with limited makespan ⋮ Restart strategies in optimization: parallel and serial cases ⋮ Multiple colony ant algorithm for job-shop scheduling problem ⋮ A time-indexed LP-based approach for min-sum job-shop problems ⋮ Bottleneck machine identification method based on constraint transformation for job shop scheduling with genetic algorithm ⋮ A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem ⋮ Efficient primal heuristic updates for the blocking job shop problem ⋮ Multiobjective optimization for complex flexible job-shop scheduling problems ⋮ The job shop scheduling problem with convex costs ⋮ Restart strategies for GRASP with path-relinking heuristics ⋮ An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling ⋮ On single-walk parallelization of the job shop problem solving algorithms ⋮ A competent memetic algorithm for complex scheduling ⋮ Solving job shop scheduling problems utilizing the properties of backbone and ``big valley ⋮ Nested partitions for the large-scale extended job shop scheduling problem ⋮ Resource allocation algorithm for light communication grid-based workflows within an SLA context ⋮ A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem ⋮ An algebraic approach for the search space of permutations with repetition ⋮ A new hybrid parallel genetic algorithm for the job‐shop scheduling problem ⋮ A tabu search algorithm for scheduling pharmaceutical packaging operations ⋮ A matheuristic for the generalized order acceptance and scheduling problem ⋮ Combining prospect theory with fuzzy theory to handle disruption in production scheduling
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The job shop scheduling problem: Conventional and new solution techniques
- Benchmarks for shop scheduling problems
- Constraint propagation techniques for the disjunctive scheduling problem
- Deterministic job-shop scheduling: Past, present and future
- Constraint propagation and problem decomposition: A preprocessing procedure for the job shop problem
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem
- Benchmarks for basic scheduling problems
- A computational study of shifting bottleneck procedures for shop scheduling problems
- Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Job Shop Scheduling by Simulated Annealing
- 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
- Job Shop Scheduling by Local Search
- Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments
- New and ``stronger job-shop neighbourhoods: A focus on the method of Nowicki and Smutnicki (1996)
This page was built for publication: An advanced tabu search algorithm for the job shop problem
