A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling (Q857328): Difference between revisions

Latest revision as of 10:41, 25 June 2024

scientific article

Language	Label	Description	Also known as
English	A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling	scientific article

Statements

instance of

scholarly article

0 references

title

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

0 references

author

N. E. Zubov

0 references

published in

European Journal of Operational Research

0 references

publication date

14 December 2006

0 references

zbMATH Keywords

simulated annealing

0 references

tabu search

0 references

adaptive memory programming

0 references

meta-heuristics

0 references

job shop scheduling

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ejor.2005.12.013

0 references

cites work

The Shifting Bottleneck Procedure for Job Shop Scheduling

0 references

Greedy random adaptive memory programming search for the capacitated clustering problem

0 references

A Computational Study of the Job-Shop Scheduling Problem

0 references

The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling

0 references

A new adaptive multi-start technique for combinatorial global optimizations

0 references

Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments

0 references

An Algorithm for Solving the Job-Shop Problem

0 references

Q4319398

0 references

Applying tabu search to the job-shop scheduling problem

0 references

Greedy randomized adaptive search procedures

0 references

Future paths for integer programming and links to artificial intelligence

0 references

Q4079017

0 references

Deterministic job-shop scheduling: Past, present and future

0 references

Optimization by Simulated Annealing

0 references

A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops

0 references

An efficient genetic algorithm for job shop scheduling with tardiness objectives.

0 references

A repairing technique for the local search of the job-shop problem.

0 references

A fast tabu search algorithm for the permutation flow-shop problem

0 references

Local search genetic algorithms for the job shop scheduling problem

0 references

Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem

0 references

An experimental analysis of local minima to improve neighbourhood search.

0 references

Parallel Taboo Search Techniques for the Job Shop Scheduling Problem

0 references

A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows

0 references

Adaptive memory programming: a unified view of metaheuristics

0 references

An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem

0 references

Job Shop Scheduling by Simulated Annealing

0 references

Job Shop Scheduling by Local Search

0 references

An effective hybrid optimization strategy for job-shop scheduling problems

0 references

Jointly solving the group scheduling and machining speed selection problems: A hybrid tabu search and simulated annealing approach

0 references

Identifiers

zbMATH Open document ID

1102.90020

0 references

DOI

10.1016/j.ejor.2005.12.013

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:857328

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