Main Article Content
Abstract
This work describes a genetic algorithm and tabu search approach that will be
hybrided to CDS algorithm to solve the flowshop scheduling with availability constraint. In
such problem, machine are not available to work with, because it must entering the
maintenance time. In this paper, two variant of non preemptive with an arbitrary number of
machines and arbritary number of unavailability constrainton each of them considered.
Computational experiments are performed on randomly generated instances to show the
efficiency of the proposed approaches.
Keywords: flowshop, multiple objectives, genetic algorithm, availability constraint, tabu
search.
hybrided to CDS algorithm to solve the flowshop scheduling with availability constraint. In
such problem, machine are not available to work with, because it must entering the
maintenance time. In this paper, two variant of non preemptive with an arbitrary number of
machines and arbritary number of unavailability constrainton each of them considered.
Computational experiments are performed on randomly generated instances to show the
efficiency of the proposed approaches.
Keywords: flowshop, multiple objectives, genetic algorithm, availability constraint, tabu
search.