Buscar
Mostrando ítems 1-10 de 23
An effective MILP-based decomposition algorithm for the scheduling and redesign of flexible job-shop plants
(Italian Association of Chemical Engineering, 2019-06)
This paper presents a decomposition algorithm for the integrated scheduling and redesign problem of a multistage batch plant dealing with multipurpose units and heterogeneous recipes. First, the procedure solves the ...
Programación de la producción a corto plazo y de tareas de mantenimiento preventivo en ambientes Job Shop Flexibles
(Universidade Federal de Santa Catarina, 2016-06)
Se aborda el problema de scheduling predictivo en plantas industriales de tipo Job Shop Flexible para el que se ha desarrollado un modelo basado en programación con restricciones (Constraint Programming, CP) que permite ...
Production scheduling and lot streaming at flexible job-shops environments using constraint programming
(Pergamon-Elsevier Science Ltd, 2019-10)
In this contribution, the scheduling at flexible job-shops and the lot streaming problem are simultaneously addressed, by means of a novel Constraint Programming (CP) approach. The proposed CP model can efficiently tackle ...
Dispatching algorithm for production programming of flexible job-shop systems in the smart factory industry
(Annals Of Operations Research, 2018)
MILP model for the planning of a computerized numerical control lathes machining plant
(Centro Latinoamericano de Estudios Informáticos, 2021-07)
This work introduces the formulation and application of a MILP model to solve the problem of planning the weekly production of a machining plant using numerical control lathes to manufacture spare parts for agricultural ...
A dispatching-fuzzy ahp-topsis model for scheduling flexible job-shop systems in industry 4.0 context
(Corporación Universidad de la Costa, 2021)
Parallelism and Hybridization in Differential Evolution to solve the Flexible Job Shop Scheduling ProblemParalelismo e hibridización en un algoritmo de evolución diferencial para resolver el ´ problema de planificación job shop flexible
(Universidad Nacional de La Plata. Facultad de Informática, 2020-05-26)
El problema de programación flexible del taller de trabajos (FJSSP) es uno de los problemas de optimización combinatoria más desafiantes, con aplicabilidad práctica en un entorno de producción real. En este trabajo, ...