Programación de la producción en máquinas paralelas sujeto a adelantos, retrasos y fechas límite
[EN] This Final Master's Work deals with the scheduling of production on unrelated parallel machines, taking into account launch dates, deadlines, sequence and machinedependent preparation times in order to minimize weighted earliness and weighted tardiness. A heuristic / metaheuristic meth...
| Author: | |
|---|---|
| Format: | master thesis |
| Publication Date: | 2017 |
| Country: | España |
| Institution: | Universitat Politècnica de València (UPV) |
| Repository: | RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia |
| Language: | Spanish |
| OAI Identifier: | oai:riunet.upv.es:10251/89995 |
| Online Access: | https://riunet.upv.es/handle/10251/89995 |
| Access Level: | Open access |
| Keyword: | Secuenciación Máquinas Paralelas Heurística ESTADISTICA E INVESTIGACION OPERATIVA Máster Universitario en Ingeniería de Análisis de Datos, Mejora de Procesos y Toma de Decisiones-Màster Universitari en Enginyeria d&apos Anàlisi de Dades, Millora de Processos i Presa de decisions |
| Summary: | [EN] This Final Master's Work deals with the scheduling of production on unrelated parallel machines, taking into account launch dates, deadlines, sequence and machinedependent preparation times in order to minimize weighted earliness and weighted tardiness. A heuristic / metaheuristic method is proposed to solve it. We propose a mathematical model of mixed integer linear programming and the implementation of the model in Lingo version 17. The proposed method is a genetic algorithm whose initial population consists of solutions obtained from the dispatch rule SPT and random solutions. The algorithm has been implemented in C #. The necessary computational tests have been carried out to evaluate the proposed methods. Statistical evaluations have been performed to calibrate the proposed algorithm. Statistical analyzes indicate that the version of the algorithm that incorporates operators that have the possibility of including idle times is the one that works best. |
|---|