An advanced tabu search algorithm for the job shop problem
From MaRDI portal
Publication:2464439
DOI10.1007/s10951-005-6364-5zbMath1154.90479MaRDI QIDQ2464439
Eugeniusz Nowicki, Czesław Smutnicki
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
90B35: Deterministic scheduling theory in operations research
Related Items
A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem, A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective, Restart strategies in optimization: parallel and serial cases, A time-indexed LP-based approach for min-sum job-shop problems, Solving job shop scheduling problems utilizing the properties of backbone and ``big valley, A tabu search algorithm for scheduling pharmaceutical packaging operations, Nested partitions for the large-scale extended job shop scheduling problem, Multiple colony ant algorithm for job-shop scheduling problem, Resource allocation algorithm for light communication grid-based workflows within an SLA context
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)