Aplicación del algoritmo lompen a los problemas Fm | prmu | Cmac y Fm | block | Cmax
Document typeExternal research report
Rights accessOpen Access
In this paper we face the permutation flow-shop scheduling problem with a makespan objective function in two variants, with and without storage space between machines. We use an improved branch and bound algorithm, suitable for parallel computation, to solve these problems, and auxiliary heuristics to attain an initial good solution. The auxiliary heuristics proposed are built by two steps: in the first step a permutation is obtained; in the second step a local search procedure is applied. The improvement obtained by the local search procedure on NEH heuristic as first step is shown. Since the flow-shop scheduling problem with storage space is a relaxation of the problem without storage space, some elements and procedures developed for that problem can be used in both problems. In particular, some bounding procedures, for instance Nabeshima or Lageweg bounding schema, can be adapted. Moreover, the reversibility property holds on both problems. Consequently the branch and bound algorithm can be applied simultaneously to the direct and the inverse instances. The same sets of data are submitted to heuristics and to the double branch-and-bound algorithm, LOMPEN, assuming first they are instances of flow-shop scheduling problem with storage space and later they are instances of flow-shop scheduling problem without storage space. The algorithms are coded in a similar way; therefore the behaviour and performance can be compared.
Is part ofDITS; S/N