A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling

DOI10.1016/j.ejor.2005.12.013zbMath1102.90020MaRDI QIDQ857328

N. E. Zubov

Publication date: 14 December 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.12.013

zbMATH Keywords

simulated annealing; tabu search; job shop scheduling; meta-heuristics; adaptive memory programming

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Local search genetic algorithms for the job shop scheduling problem
• Greedy random adaptive memory programming search for the capacitated clustering problem
• A fast tabu search algorithm for the permutation flow-shop problem
• A new adaptive multi-start technique for combinatorial global optimizations
• A repairing technique for the local search of the job-shop problem.
• An experimental analysis of local minima to improve neighbourhood search.
• An efficient genetic algorithm for job shop scheduling with tardiness objectives.
• A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
• Greedy randomized adaptive search procedures
• Deterministic job-shop scheduling: Past, present and future
• Future paths for integer programming and links to artificial intelligence
• An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
• Applying tabu search to the job-shop scheduling problem
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• An Algorithm for Solving the Job-Shop Problem
• Job Shop Scheduling by Simulated Annealing
• A Computational Study of the Job-Shop Scheduling Problem
• Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• Jointly solving the group scheduling and machining speed selection problems: A hybrid tabu search and simulated annealing approach
• The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
• Job Shop Scheduling by Local Search
• Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments
• An effective hybrid optimization strategy for job-shop scheduling problems
• Adaptive memory programming: a unified view of metaheuristics