Buscar
Mostrando ítems 31-40 de 123
Estudio del problema de programación de la producción en un ambiente multi-propósito flexible con división de lotes
(Universidad Autónoma Metropolitana (México). Unidad Azcapotzalco. Coordinación de Servicios de Información., 2018)
El problema de programación de tareas conocido como programación de la producción en un ambiente multi-propósito flexible con división de lotes es una variante del problema de tipo programación de la producción, en la cual ...
Tradução automática de problemas de escalonamento job shop flexível com bloqueio para autômatos utilizando a TCS
(Universidade Federal de Minas GeraisBrasilEEFFTO - ESCOLA DE EDUCAÇÃO FISICA, FISIOTERAPIA E TERAPIA OCUPACIONALENG - DEPARTAMENTO DE ENGENHARIA ELETRÔNICAICX - DEPARTAMENTO DE MATEMÁTICAUFMG, 2020-12-08)
This work presents an algorithm to automatically translate the search space of a Blocking Flexible Job Shop Scheduling Problem modeling into automata using the Supervisory Control Theory. Some problems of the literature ...
The Non-Permutation Flow-Shop scheduling problem: A literature review
(Pergamon-Elsevier Science Ltd, 2018-06)
The Non-Permutation Flow-Shop scheduling problem (NPFS) is a generalization of the traditional Permutation Flow-Shop scheduling problem (PFS) that allows changes in the job order on different machines. The flexibility that ...
Scheduling jobs on a k-stage flexible flow-shop
(Annals of Operations Research, 2008)
We consider the problem of makespan minimization on a flexible flow shop with
k stages and ms machines at any stage. We propose a heuristic algorithm based on the identification and exploitation of the bottleneck stage, ...
Applying toc heuristics to job scheduling in a hybrid flexible flow shop
(Universidad Nacional de Colombia Sede Medellín, 2014-08-25)
This paper introduces an application of the Theory of Constraints product mix heuristic to job scheduling in a Hybrid Flexible Flow Shop. The general heuristic is adapted for unrelated parallel machines and the algorithm ...
Choice of a PISA selector in a hybrid algorithmic structure for the FJSSP
(Growing Science, 2015-04)
This paper analyzes the choice of a PISA selector for a Hybrid Algorithm integrating it as a MultiObjective Evolutionary Algorithm (MOEA) with a path-dependent search algorithm. The interaction between these components ...
An optimization algorithm for the multi-objective flexible fuzzy job shop environment with partial flexibility based on adaptive teaching–learning considering fuzzy processing times
(Cartagena de Indias, 2023)
Production scheduling is a critical factor to enhancing productivity in manufacturing engineering and combinatorial optimization research. The complexity and dynamic nature of production systems necessitates innovative ...
Modelo de programación de producción en planta tipo Flexible Job Shop (FJSSP) con tiempos difusos de procesamiento y alistamiento dependiente de la secuencia, y ventanas de tiempo en las entregas, mediante algoritmos genéticos
(2018-06-06)
El objeto de estudio del presente trabajo final de maestría es la programación de producción en plantas con configuración Flexible Job Shop en condiciones de incertidumbre. El problema de investigación se seleccionó debido ...
Iterated local search and constructive heuristics for minimizing total tardiness in flexible job shop
(Institute for Operations Research and the Management Sciences - INFORMSMinneapolis, Minnesota, 2013)
An Iterated Local Search (ILS) is used to minimize total tardiness in the Flexible Job Shop. New priority rules associated with list scheduling algorithms that exploit characteristics of the problem are proposed. The ILS ...