Optimización del makespan en el problema de Job Shop Flexible con restricciones de transporte usando Algoritmos Genéticos
Authors:
- Tatiana Andrea Castillo JaimesTJTatiana Andrea Castillo Jaimes
- Carlos Eduardo Díaz BohórquezCBCarlos Eduardo Díaz Bohórquez
- Juan David Gómez MorenoJMJuan David Gómez Moreno
- Edwin Alfredo Orduz GonzálesEGEdwin Alfredo Orduz Gonzáles
- Myriam Leonor Niño LopezMLMyriam Leonor Niño Lopez
Open Access
- 12 December 2018
- journal article
- Published by Universidad Catolica de Pereira in Entre Ciencia e Ingeniería
- Vol. 12 (24) , 105-115
Abstract
We solved the Flexible Job Shop Scheduling Problem (FJSSP) with transportation constraints in order to minimize the makespan by sequencing and assigning machines. A bibliographic review was made in order to guide the methodology to be used. From there, we approached the problem with a genetic algorithm. We validated its eff ectiveness by comparing the results obtained with diff erent instances proposed in the literature. The results obtained show that the proposed genetic algorithm is efficient in the diff erent classic Job Shop confi gurations tested. The algorithm is able to find very approximate solutions to the best found to date for the Flexible Job Shop Scheduling Problem with transportation constraints.Keywords
This publication has 21 references indexed in Scilit:
- A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing timesComputers & Operations Research, 2012
- A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local searchInternational Journal of Production Economics, 2011
- An Improved Genetic Algorithm for the Distributed and Flexible Job-shop Scheduling problemEuropean Journal of Operational Research, 2010
- An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problemComputers & Industrial Engineering, 2009
- An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problemsComputers & Industrial Engineering, 2005
- Makespan minimization for flow-shop problems with transportation times and a single robotDiscrete Applied Mathematics, 2001
- Deterministic job-shop scheduling: Past, present and futureEuropean Journal of Operational Research, 1999
- Job-shop scheduling with multi-purpose machinesComputing, 1990
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954