[EN] In recent years, a large number of heuristics have been proposed for the minimization of the total or mean flowtime/completion time of the well-known permutation flowshop scheduling problem. Although some literature ...
[EN] The permutation flowshop problem is a classic machine scheduling problem where n jobs must be processed on a set of m machines disposed in series and where each job must visit all machines in the same order. Many ...
In the no-idle flowshop, machines cannot be idle after finishing one job and before starting the next one.
Therefore, start times of jobs must be delayed to guarantee this constraint. In practice machines show
this ...
Wang, Yamin; Li, Xiaoping; Ruiz García, Rubén; Sui, S.(Institute of Electrical and Electronics Engineers, 2018-05)
[EN] The mixed no-wait flowshop problem with both wait and no-wait constraints has many potential real-life applications. The problem can be regarded as a generalization of the traditional permutation flowshop and the ...
Se describen y explican con diagramas de Gantt varias soluciones donde se han de secuenciar trabajos en un taller de flujo y existen restricciones de capacidad.
Almost all manufacturing facilities need to use production planning and scheduling systems to increase productivity and to reduce production costs. Real-life production operations are subject to a large number of unexpected ...
Yepes-Borrero, Juan C.; Perea, Federico; Villa Juliá, Mª Fulgencia; Vallada Regalado, Eva(Elsevier, 2023-06)
[EN] Machine scheduling problems arise in many production processes, and are something that needs to be consider when optimizing the supply chain. Among them, flowshop scheduling problems happen when a number of jobs have ...
Flowshop scheduling is a very active research area. This problem still attracts a considerable amount of interest despite the sheer amount of available results. Total flowtime minimization of a flowshop has been actively ...
Li, Xiaoping; Jiang, Y.; Ruiz García, Rubén(Institute of Electrical and Electronics Engineers, 2018-05)
[EN] Workers with different levels of experience and knowledge have different effects on job processing times. By taking into account 1) the sum-of-processing-time; 2) the job-position; and 3) the experience of workers, a ...
Vallada Regalado, Eva; Ruiz García, Rubén; Framinan, Jose M.(Elsevier, 2015-02-01)
[EN] In this work a new benchmark of hard instances for the permutation flowshop scheduling problem with
the objective of minimising the makespan is proposed. The new benchmark consists of 240 large instances and 240 small ...
Piérola Orcero, Ana(Universitat Politècnica de València, 2016-11-02)
[EN] This
MSc.
Thesis
gathers
the
description,
implementation
and
evaluation
of
heuristic
and
metaheuristic
scheduling
methods
in
no-‐idle
production
environments
Mataix Tortosa, Alberto(Universitat Politècnica de València, 2014-05-19)
[ES] En este trabajo final de máster se realiza un algoritmo genético para resolver problemas de programación de la producción pertenecientes al taller de flujo con recursos adicionales limitados
Multi-objective optimisation problems have seen a large impulse in the last decades. Many new techniques for solving distinct variants of multi-objective problems have been proposed. Production scheduling, as with other ...
Andrés Romano, Carlos(Universitat Politècnica de València, 2014-07-08)
Se explica la manera en que se aplica la regla heurística de Nawaz, Enscore y Hawaz para resolver de manera heurística el problema de secuenciación en un taller de flujo de m máquinas
Andrés Romano, Carlos(Universitat Politècnica de València, 2012-06-28)
En esta presentación se describe el concepto de taller de fluj o de dós máquinas y su dificultad para resolverlo de manera óptima. Se explica con una aplicación cómo el Algoritmo de Johnson permite resolver este tipo de problemas