A taxonomy of flexible flow line scheduling procedures

Quadt, Daniel; Kühn, Heinrich

doi:10.1016/j.ejor.2006.01.042

Cited by 99 publications

(50 citation statements)

References 59 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…These include exact methods, heuristics, and metaheuristics. The present review fills in some of the gaps identified in previous reviews, like those of, [204,117,213] or more recently [151], and describes the most recent approaches. It also identifies research opportunities and proposes some interesting research lines.…”

Section: Introductionmentioning

confidence: 98%

“…The HFS with multiprocessor tasks is studied for the makespan criterion by [175] and by [139] and approached with GA. A GA and a SA were proposed for a fairly complex cyclic scheduling flexible flow line with lot sizing in [85]. Another complex problem with production time windows in flexible flow lines is exposed in [151]. In [210], the authors use GA to explore the permutation space for the first stage of the shop and dispatching rules others than the first in first out for the rest.…”

Section: Metaheuristicsmentioning

confidence: 99%

See 1 more Smart Citation

The hybrid flow shop scheduling problem

Ruíz

Vázquez-Rodríguez

2010

European Journal of Operational Research

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: Introductionmentioning

confidence: 98%

Section: Metaheuristicsmentioning

confidence: 99%

The hybrid flow shop scheduling problem

Ruíz

Vázquez-Rodríguez

2010

European Journal of Operational Research

680

236

View full text Add to dashboard Cite

show abstract

“…This is confirmed by the hybrid flowshop reviews of Vignier et al (1999), Linn and Zhang (1999), Quadt and Kuhn (2007), Ruiz and Vázquez Rodríguez (2010) and Ribas et al (2010). We have presented two algorithms for solving the hybrid flowshop problem with unrelated parallel machines in each of the stages.…”

Section: Discussionsupporting

confidence: 56%

“…The latter conclude that there exists a gap between theory and practice and that there is need of future research in this direction. Quadt and Kuhn (2007) categorise the papers on hybrid flowshop problems in a taxonomy. The most recent reviews are the ones by Ruiz and Vázquez Rodríguez (2010) and Ribas et al (2010).…”

Section: Motivation For This Phd Thesismentioning

confidence: 99%

Heuristics and metaheuristics for heavily constrained hybrid flowshop problems

Urlings¹

View full text Add to dashboard Cite

Es ist nicht genug zu wissen, man muss auch anwenden.Es ist nicht genug zu wollen, man muss auch tun.Knowing is not enough, we must apply.Willing is not enough, we must do.Johann Wolfgang von Goethe, Wilhelm Meisters Wanderjahre, 1821. I ABSTRACT HEURISTICS AND METAHEURISTICS FOR HEAVILY CONSTRAINED HYBRID FLOWSHOP PROBLEMSDue to the current trends in business as the necessity to have a large catalogue of products, orders that increase in frequency but not in size, globalisation and a market that is increasingly competitive, the production sector faces an ever harder economical environment. All this raises the need for production scheduling with maximum efficiency and effectiveness.The first scientific publications on production scheduling appeared more than half a century ago. However, many authors have recognised a gap between the literature and the industrial problems. Most of the research concentrates on optimisation problems that are actually a very simplified version of reality. This allows for the use of sophisticated approaches and guarantees in many cases that optimal solutions are obtained. Yet, the exclusion of real-world restrictions harms the applicability of those methods. What the industry needs are systems for optimised production scheduling that adjust exactly to the conditions in the production plant and that generates good solutions in very little time. This is exactly the objective in this thesis, that is, to treat more realistic scheduling problems and to help closing the gap between the literature and practice.The considered scheduling problem is called the hybrid flowshop problem, which consists in a set of jobs that flow through a number of production stages. At each of the stages, one of the machines that belong to the stage is visited. III IVA series of restriction is considered that include the possibility to skip stages, non-eligible machines, precedence constraints, positive and negative time lags and sequence dependent setup times. In the literature, such a large number of restrictions has not been considered simultaneously before. Briefly, in this thesis a very realistic production scheduling problem is studied.Various optimisation methods are presented for the described scheduling problem. A mixed integer programming model is proposed, in order to obtain optimal solutions for limited cases and in order to analyse the complexity of each of the problem restrictions. In continuation, seven constructive heuristics are presented with the purpose of obtaining fast solutions to the problem in more general cases. Advanced metaheuristic methods are studied in detail, starting with five genetic algorithms that allow studying the effect of the solution representation. Three local search based algorithms are proposed, which is very novel if the elevated complexity of the problem is taken into account. In addition, novel methods are presented that shift the solution representation during the search process in order to acquire near-optimal solutions. The obtained results endorse the use of thes...

show abstract

“…This applicability of the flowshop is also highlighted in the many exiting reviews from the literature like Framinan et al (2004), Ruiz and Maroto (2005), Hejazi and Saghafian (2005) and Gupta and Stafford (2006). As a matter of fact, once generalized to hybrid flowshops or flexible flowline problems, many production problems can be modeled after a flowshop (Linn and Zhang, 1999;Vignier et al, 1999;Wang, 2005;Quadt and Kuhn, 2007;Ruiz and Vázquez-Rodríguez, 2010;Ribas et al, 2010). The FSP can be formally described as follows: A set N of n different and independent jobs has to be scheduled.…”

Section: Introductionmentioning

confidence: 99%

A scatter search algorithm for the distributed permutation flowshop scheduling problem

Naderi

Ruíz

2014

European Journal of Operational Research

242

View full text Add to dashboard Cite

The distributed permutation flowshop problem has been recently proposed as a generalization of the regular flowshop setting where more than one factory is available to process jobs. Distributed manufacturing is a common situation for large enterprises that compete in a globalized market. The problem has two dimensions: assigning jobs to factories and scheduling the jobs assigned to each factory. Despite being recently introduced, this interesting scheduling problem has attracted attention and several heuristic and metaheuristic methods have been proposed in the literature. In this paper we present a scatter search (SS) method for this problem to optimize makespan. SS has seldom been explored for flowshop settings. In the proposed algorithm we employ some advanced techniques like a reference set made up of complete and partial solutions along with other features like restarts and local search. A comprehensive computational campaign including 10 existing algorithms, together with statistical analyses, shows that the proposed scatter search algorithm produces better results than existing algorithms by a significant margin. Moreover all 720 known best solutions for this problem are improved.

show abstract

A taxonomy of flexible flow line scheduling procedures

Cited by 99 publications

References 59 publications

The hybrid flow shop scheduling problem

The hybrid flow shop scheduling problem

Heuristics and metaheuristics for heavily constrained hybrid flowshop problems

A scatter search algorithm for the distributed permutation flowshop scheduling problem

Contact Info

Product

Resources

About