Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
From MaRDI portal
Publication:1826491
DOI10.1023/B:HEUR.0000019987.10818.e0zbMath1061.90093OpenAlexW2090589401MaRDI QIDQ1826491
Roberto Tadei, Marco Ghirardi, Frederico Della Croce
Publication date: 6 August 2004
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:heur.0000019987.10818.e0
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Optimal allocation and processing time decisions on non-identical parallel CNC machines: \(\epsilon\)-constraint approach ⋮ A single machine scheduling problem with two-dimensional vector packing constraints ⋮ Practical solutions for a dock assignment problem with trailer transportation ⋮ Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems ⋮ A hybrid heuristic approach for single machine scheduling with release times ⋮ Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling ⋮ Discrete-time, economic lot scheduling problem on multiple, non-identical production lines ⋮ Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items ⋮ A beam search approach for the optimization version of the car sequencing problem ⋮ Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups ⋮ Coupling genetic local search and recovering beam search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates ⋮ A recovering beam search algorithm for the single machine just-in-time scheduling problem ⋮ Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach ⋮ Capacity allocation problem in flexible manufacturing systems: branch and bound based approaches ⋮ Iterated greedy local search methods for unrelated parallel machine scheduling ⋮ A matheuristic approach for the two-machine total completion time flow shop problem ⋮ BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS ⋮ Hybridizing exact methods and metaheuristics: a taxonomy ⋮ An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
Uses Software
