Modeling realistic hybrid flexible flowshop scheduling problems

Ruíz, Rubén; Şerifoğlu, Funda Sivrikaya; Urlings, Thijs

doi:10.1016/j.cor.2006.07.014

Cited by 148 publications

(81 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…[116] studied a real label sticker manufacturing problem modeled as a 2-stage HFS with sequence dependent setup times and machine eligibility. [160] have studied a complex problem from the ceramic tile sector with unrelated parallel machines, sequence dependent setup times, machine eligibility, machine release dates, positive and negative lags, stage skipping, non-anticipatory setups and job precedence constraints. Some mathematical models and heuristics are proposed.…”

Section: Heuristicsmentioning

confidence: 99%

The hybrid flow shop scheduling problem

Ruíz

Vázquez-Rodríguez

2010

European Journal of Operational Research

Self Cite

680

236

View full text Add to dashboard Cite

The scheduling of flow shops with multiple parallel machines per stage, usually referred to as the Hybrid Flow Shop (HFS), is a complex combinatorial problem encountered in many real world applications. Given its importance and complexity, the HFS problem has been intensively studied. This paper presents a literature review on exact, heuristic and metaheuristic methods that have been proposed for its solution.The paper discusses several variants of the HFS problem, each in turn considering different assumptions, constraints and objective functions. Research opportunities in HFS are also discussed.

show abstract

Section: Heuristicsmentioning

confidence: 99%

The hybrid flow shop scheduling problem

Ruíz

Vázquez-Rodríguez

2010

European Journal of Operational Research

Self Cite

680

236

View full text Add to dashboard Cite

show abstract

“…Desafortunadamente, los problemas de scheduling en el mundo real, al presentar un conjunto de restricciones propias de estos entornos, se convierten en problemas mucho más desafiantes, dificultando, en muchos casos, la aplicabilidad de dichos métodos (Ruiz, Sivrikaya, y Urlings, 2008).…”

Section: Introductionunclassified

Un Algoritmo Genético Híbrido para la Optimización del Flow Shop Scheduling bajo Restricciones de Entornos Reales

et al. 2017

View full text Add to dashboard Cite

Este trabajo tiene como objetivo analizar el efecto de la inclusión de varias restricciones que influyen negativamente en la programación de la producción en un ambiente de manufactura real. Para la solución del problema de secuenciación tratado en esta investigación, conocido como Flow Shop Scheduling, se introduce un eficiente Algoritmo Genético combinado con una Búsqueda Local de Vecindad Variable para problemas de n tareas y m máquinas minimizando el tiempo de completamiento total de las tareas o makespan. Las restricciones de fechas de liberación, tiempos de configuración dependientes de la secuencia y tiempos de transportación son introducidas. Estas son restricciones comunes que pueden ser encontradas en múltiples ambientes manufactureros donde existen máquinas y herramientas, y un conjunto de tareas debe procesarse en estas siguiendo el mismo patrón de flujo. Los experimentos computacionales realizados sobre un conjunto de instancias de problemas de diferentes tamaños de complejidad demuestran que la metaheurística híbrida propuesta alcanza soluciones de alta calidad comparables con los óptimos reportados.

show abstract

“…This time, they add some simple simulated annealing and tabu search algorithms to the comparison. Also recently, Ruiz, Sivrikaya Serifoglu and Urlings (2008) consider a realistic case of hybrid flexible flowshops with unrelated machines, setup times and many other additional characteristics like overlaps, precedence relationships and others. They present a mixed integer programming and some heuristics.…”

Section: Literature Review Of Sdst Hybrid Flexible Flowshopsmentioning

confidence: 99%

Algorithms for a realistic variant of flowshop scheduling

Naderi

Ruíz

Zandieh

2010

Computers & Operations Research

Self Cite

View full text Add to dashboard Cite

This paper deals with a realistic variant of flowshop scheduling, namely the hybrid flexible flowshop. A hybrid flowshop mixes the characteristics of regular flowshops and parallel machine problems by considering stages with parallel machines instead of having one single machine per stage. We also investigate the flexible version where stage skipping might occur, i.e., not all stages must be visited by all jobs. Lastly, we also consider job sequence dependent setup times per stage. The optimization criterion considered is makespan minimization. The literature is plenty with approaches for hybrid flowshops. However, hybrid flexible flowshops have been seldom studied. The situation is even worse with the addition of sequence dependent setups. In this study, we propose two advanced algorithms that specifically deal with the flexible and setup characteristics of this problem. The first algorithm is a dynamic dispatching rule heuristic, and the second is an iterated local search metaheuristic. The proposed algorithms are evaluated by comparison against seven other high performing existing algorithms. The statistically sound results support the idea that the proposed algorithms are very competitive for the studied problem.

show abstract

Modeling realistic hybrid flexible flowshop scheduling problems

Cited by 148 publications

References 38 publications

The hybrid flow shop scheduling problem

The hybrid flow shop scheduling problem

Un Algoritmo Genético Híbrido para la Optimización del Flow Shop Scheduling bajo Restricciones de Entornos Reales

Algorithms for a realistic variant of flowshop scheduling

Contact Info

Product

Resources

About