Modelo de programación de la producción con cancelación de trabajos en sistemas open shop mediante algoritmos meméticos

Abstract

Within combinatorial optimization, machine scheduling is one of the most relevant problems to solve, which allows companies to make decisions on operations management, specifically in the definition of a schedule that dictates the order in which process the activities corresponding to a set of jobs on a set of machines. This research proposes a memetic algorithm in which an iterated local search method will enhance a metaheuristic developed by the authors called FLW. The metaheuristics is based on agents and considers different mechanisms for exploring and escaping local optima that have shown efficient results in continuous domains. The application is carried out in the open shop scheduling problem with the minimization of the makespan as objective function, additionally the algorithm will contemplate the possibility that a job can be canceled and that a job enters the system at any moment of the construction of the solution.