Focused simulated annealing search: An application to job shop scheduling
type: Item
instance of: scholarly article
title: Focused simulated annealing search: An application to job shop scheduling
zbMATH Open document ID: 0849.90079
DOI: 10.1007/BF02601640
author: Norman M. Sadeh
author: Yoichiro Nakakuki
published in: Annals of Operations Research
publication date: 1996-09-18T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 910200
zbMATH Keywords: simulated annealing search procedure
zbMATH Keywords: job shop scheduling
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
cites work: Q3938812
cites work: Q4198056
cites work: One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
cites work: Future paths for integer programming and links to artificial intelligence
cites work: Q4079017
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
cites work: Optimization by Simulated Annealing
cites work: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
cites work: The Single Machine Early/Tardy Problem
cites work: Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
cites work: Job Shop Scheduling by Simulated Annealing
description: scientific article; zbMATH DE number 910200