Improving the Efficiency of Tabu Search for Machine Sequencing Problems

From MaRDI portal
Publication:5289348

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




Related Items (24)

Unrelated parallel machine scheduling using local searchAn effective differential evolution algorithm for permutation flow shop scheduling problemGenetic algorithms and tabu search: Hybrids for optimizationA particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problemA simple and effective iterated greedy algorithm for the permutation flowshop scheduling problemUsing tabu search to solve the common due date early/tardy machine scheduling problemCommon due-date determination and sequencing using tabu searchA comparison of neighborhood search techniques for multi-objective combinatorial problemsA comparison of local search methods for flow shop schedulingMetaheuristics: A bibliographyA comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problemsCase-based reasoning and improved adaptive search for project schedulingMultiple machine JIT scheduling: a tabu search approachA comprehensive review and evaluation of permutation flowshop heuristicsFlowshop-scheduling problems with makespan criterion: a reviewHeuristics for permutation flow shop scheduling with batch setup timesHybrid Genetic Algorithm and Invasive Weed Optimization via Priority Based Encoding for Location-Allocation Decisions in a Three-Stage Supply ChainUsing iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issuesSearch heuristics for a flowshop scheduling problem in a printed circuit board assembly processA neighbourhood scheme with a compressed solution space for the early/tardy scheduling problemThe nonpermutation flowshop scheduling problem: adjustment and bounding proceduresHeuristics for the flow line problem with setup costsA comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch sizePerformance 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