The single machine early/tardy problem
Management Science
Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
Annals of Operations Research
Variable Neighborhood Decomposition Search
Journal of Heuristics
Computers and Operations Research
Computers and Industrial Engineering
Computers and Industrial Engineering
Beam search algorithm for capacity allocation problem in flexible manufacturing systems
Computers and Industrial Engineering
Size-reduction heuristics for the unrelated parallel machines scheduling problem
Computers and Operations Research
A matheuristic approach for the total completion time two-machines permutation flow shop problem
EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
Beam search heuristics for the single and multi-commodity capacitated Multi-facility Weber Problems
Computers and Operations Research
A hybrid heuristic approach for single machine scheduling with release times
Computers and Operations Research
Hi-index | 0.00 |
A hybrid heuristic method for combinatorial optimization problems is proposed that combines different classical techniques such as tree search procedures, bounding schemes and local search. The proposed method enhances the classic beam search approach by applying to each partial solution corresponding to a node selected by the beam, a further test that checks whether the current partial solution is dominated by another partial solution at the same level of the search tree. If this is the case, the latter solution becomes the new current partial solution. This step allows to partially recover from previous wrong decisions of the beam search procedure and can be seen as a local search step on the partial solution. We present here the application to two well known combinatorial optimization problems: the two-machine total completion time flow shop scheduling problem and the uncapacitated p-median location problem. In both cases the method strongly improves the performances with respect to the basic beam search approach and is competitive with the state of the art heuristics.