Tabu search for a class of scheduling problems

DOI10.1007/BF02023077zbMATH Open0775.90237OpenAlexW2080358700MaRDI QIDQ2367005FDOQ2367005

Ronald L. Rardin, Edward L. Mooney

Publication date: 16 August 1993

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

Full work available at URL: https://doi.org/10.1007/bf02023077

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Optimization by Simulated Annealing
• Title not available (Why is that?)
• Tabu Search—Part II
• New approaches for heuristic search: A bilateral linkage with artificial intelligence
• Title not available (Why is that?)

Cited In (7)

• A user's guide to tabu search
• A tabu search algorithm for frequency assignment
• Combinatorial optimization techniques for spacecraft scheduling automation
• Heuristic algorithms for the maximum diversity problem
• Tabu search for the BWC problem
• Metaheuristics: A bibliography
• Genetic algorithms and tabu search: Hybrids for optimization

Uses Software

• Tabu search

This page was built for publication: Tabu search for a class of scheduling problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367005)