Restricted neighborhood in the tabu search for the flowshop problem

DOI10.1016/0377-2217(92)90174-8zbMath0758.90041OpenAlexW2066146342MaRDI QIDQ1203798

Belarmino Adenso-Díaz

Publication date: 18 February 1993

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

Full work available at URL: https://doi.org/10.1016/0377-2217(92)90174-8

zbMATH Keywords

tabu searchheuristicproportionate flowshopweighted tardiness of jobs

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

A comparison of neighborhood search techniques for multi-objective combinatorial problems, Metaheuristics: A bibliography, Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics, An SA/TS mixture algorithm for the scheduling tardiness problem, A fast tabu search algorithm for the permutation flow-shop problem, Some results of the worst-case analysis for flow shop scheduling, An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups, Some aspects of scatter search in the flow-shop problem, Performance enhancements to tabu search for the early/tardy scheduling problem, The hot strip mill production scheduling problem: A tabu search approach

Cites Work

• Optimization by Simulated Annealing
• Some efficient heuristic methods for the flow shop sequencing problem
• A new heuristic method for the flow shop sequencing problem
• Future paths for integer programming and links to artificial intelligence
• Focused Scheduling in Proportionate Flowshops
• On general routing problems
• An Evaluation of Flow Shop Sequencing Heuristics