Focused simulated annealing search: An application to job shop scheduling

DOI10.1007/BF02601640zbMath0849.90079MaRDI QIDQ1919835

Norman M. Sadeh, Yoichiro Nakakuki

Publication date: 18 September 1996

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

job shop scheduling; simulated annealing search procedure

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C27: Combinatorial optimization

Related Items

An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments, An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments, Two simulated annealing-based heuristics for the job shop scheduling problem, Deterministic job-shop scheduling: Past, present and future, Metaheuristics: A bibliography

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Future paths for integer programming and links to artificial intelligence
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• The Single Machine Early/Tardy Problem
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Job Shop Scheduling by Simulated Annealing
• Parallel Taboo Search Techniques for the Job Shop Scheduling Problem