Improving the Efficiency of Tabu Search for Machine Sequencing Problems

DOI10.1057/jors.1993.67zbMath0775.90238OpenAlexW2088123758MaRDI QIDQ5289348

Colin R. Reeves

Publication date: 23 August 1993

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

Full work available at URL: https://doi.org/10.1057/jors.1993.67

Mathematics Subject Classification ID

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

Related Items (24)

Unrelated parallel machine scheduling using local search ⋮ An effective differential evolution algorithm for permutation flow shop scheduling problem ⋮ Genetic algorithms and tabu search: Hybrids for optimization ⋮ A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem ⋮ A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem ⋮ Using tabu search to solve the common due date early/tardy machine scheduling problem ⋮ Common due-date determination and sequencing using tabu search ⋮ A comparison of neighborhood search techniques for multi-objective combinatorial problems ⋮ A comparison of local search methods for flow shop scheduling ⋮ Metaheuristics: A bibliography ⋮ A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems ⋮ Case-based reasoning and improved adaptive search for project scheduling ⋮ Multiple machine JIT scheduling: a tabu search approach ⋮ A comprehensive review and evaluation of permutation flowshop heuristics ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ Heuristics for permutation flow shop scheduling with batch setup times ⋮ Hybrid Genetic Algorithm and Invasive Weed Optimization via Priority Based Encoding for Location-Allocation Decisions in a Three-Stage Supply Chain ⋮ Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues ⋮ Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process ⋮ A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem ⋮ The nonpermutation flowshop scheduling problem: adjustment and bounding procedures ⋮ Heuristics for the flow line problem with setup costs ⋮ A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size ⋮ Performance enhancements to tabu search for the early/tardy scheduling problem

This page was built for publication: Improving the Efficiency of Tabu Search for Machine Sequencing Problems