Metodología selectiva de dinámica poblacional para optimizar un ambiente multiobjetivo de producción job shop

Ruiz, Santiago; Castrillón, Omar Danilo; Sarache, William

doi:10.15517/rmta.v22i1.17558

Cited by 3 publications

(3 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Figure 10 shows the production system highlighting the six processes, the machines enabled by each process, and the routes established within the production plant. In order to execute and evaluate the proposed genetic algorithm, this study considers a 2k design of experiments for parameter tuning, taking as experimental factors the population (30,50), number of iterations (1000, 2000), mutation rate (0.03, 0.1), and crossover rate (0.8, 0.9) based on the values proposed by Coello [38], Teekeng and Thammano [39], and Ruiz [40], and considering the conditions of the productive system addressed. The results of the parameter tuning are shown in Table 1.…”

Section: Methodsmentioning

confidence: 99%

Flexible Job Shop Scheduling Problem with Fuzzy Times and Due-Windows: Minimizing Weighted Tardiness and Earliness Using Genetic Algorithms

et al. 2022

View full text Add to dashboard Cite

The current requirements of many manufacturing companies, such as the fashion, textile, and clothing industries, involve the production of multiple products with different processing routes and products with short life cycles, which prevents obtaining deterministic setup and processing times. Likewise, several industries present restrictions when changing from one reference to another in the production system, incurring variable and sequence-dependent setup times. Therefore, this article aims to solve the flexible job shop scheduling problem (FJSSP) considering due windows, sequence-dependent setup times, and uncertainty in processing and setup times. A genetic algorithm is proposed to solve the FJSSP by integrating fuzzy logic to minimize the weighted penalties for tardiness/earliness. The proposed algorithm is implemented in a real-world case study of a fabric finishing production system, and it is compared with four heuristics adapted to the FJSSP such as earliest due date, critical reason, shortest processing time, and Monte Carlo simulation. Results show that the performance of the proposed algorithm provides efficient and satisfactory solutions concerning the objective function and computing time since it overperforms (more than 30%) the heuristics used as benchmarks.

show abstract

Section: Methodsmentioning

confidence: 99%

Flexible Job Shop Scheduling Problem with Fuzzy Times and Due-Windows: Minimizing Weighted Tardiness and Earliness Using Genetic Algorithms

et al. 2022

View full text Add to dashboard Cite

show abstract

“…Depending on the flow pattern of work through the plant, many types of production configurations can be distinguished, of which one of the most studied in the literature is the Job Shop. The configuration in job shop corresponds to the group of production systems that present a flexible flow strategy, in this system, the machines are organized by activity, that is, grouping those of the same type in order to maximize their use [4]. The concept of Job Shop Scheduling, although its origin is not very clear, can be attributed to Muth and Thompson for their Industrial Scheduling work [5].…”

Section: Introductionmentioning

confidence: 99%

Production scheduling for a job shop using a mathematical model

Mendoza¹,

Acosta²,

Reyes³

2018

ces

View full text Add to dashboard Cite

Today, all organizations are continually seeking to produce high quality, reliable, and timely goods and services that meet the needs of their customers. Therefore, production scheduling is one of the most complex activities in production management in organizations. In the present work, the production projection is developed in a Job Shop system using a mathematical model of linear integer programming whose objective is to minimize the total lateness. The developed model is validated by means of an application case with three jobs and four machines, obtaining the optimum programming according to the requirements. The results obtained have been compared with a scheduling software to evaluate the performance of the proposed model.

show abstract

“…El problema de la secuenciación de "Job Shop" puede ser tratado como una tarea de optimización de un objetivo, por ejemplo; el tiempo de entrega del producto [6], o de varios objetivos, visto con un enfoque más integrador como una tarea de optimización multiobjetivo con la aplicación de metaheurísticas como el Algoritmo Genético, Enfriamiento Simulado y Colonia de Hormigas, para conciliar por ejemplo: el tiempo total de proceso, costo de energía, entre otros aspectos [7][8][9].…”

Section: Introductionunclassified

Procedimiento para la fabricación de elementos de máquinas mediante tecnología de grupo en la pequeña y mediana empresa

García

Tamayo²,

Aleaga

et al. 2017

Ingeniare. Rev. chil. ing.

View full text Add to dashboard Cite

RESUMENLa presente investigación persigue como objetivo la concepción de un procedimiento basado en la Tecnología de Grupo, para la generación automática de rutas de procesos y tecnologías de fabricación en familias de piezas obtenidas a partir del proceso de maquinado. Se presenta un algoritmo para la implementación de dicho procedimiento por medio de una herramienta informática desarrollada en software libre con posibilidades de aplicación en el sector de la pequeña y mediana empresa. Los resultados obtenidos muestran una vía para incrementar la eficiencia y la capacidad de respuesta de la pequeña y mediana empresa, ante la gran variedad de productos y creciente demanda de fabricación.Palabras clave: Tecnología de grupo, proceso de mecanizado, familia de piezas, software libre, eficiencia de la producción. ABSTRACTThe objective of this paper is to obtain a procedure based on the Group Technologies, for automatic generation of routes manufacturing processes and technologies in the families of the parts that will be obtained from the machining process. An algorithm for the implementation of this procedure is presented through a software tool developed in free software with possible applications in the field of small and medium enterprises. The results show a way to increase the efficiency and capacity to respond to the small and medium enterprises, given the variety of products and increasing demand for manufacturing.

show abstract

Metodología selectiva de dinámica poblacional para optimizar un ambiente multiobjetivo de producción job shop

Cited by 3 publications

References 3 publications

Flexible Job Shop Scheduling Problem with Fuzzy Times and Due-Windows: Minimizing Weighted Tardiness and Earliness Using Genetic Algorithms

Flexible Job Shop Scheduling Problem with Fuzzy Times and Due-Windows: Minimizing Weighted Tardiness and Earliness Using Genetic Algorithms

Production scheduling for a job shop using a mathematical model

Procedimiento para la fabricación de elementos de máquinas mediante tecnología de grupo en la pequeña y mediana empresa

Contact Info

Product

Resources

About