Polynomial-time local-improvement algorithm for Consecutive Block Minimization
A polynomial-time heuristic for Consecutive Block Minimization is given. The whole algorithm consists of a sequential application of two local-improvement procedures. The associated neighborhoods are the first proposed for local search on this problem. The algorithm is tested only to point the influence of the problem parameters on the computing time.
local-improvement consecutive block minimization combinatorial problems approximation algorithms