Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective

Ribas, Imma; Leisten, Rainer; Framiñán, José M.

doi:10.1016/j.cor.2009.11.001

Cited by 372 publications

(160 citation statements)

References 154 publications

Supporting

Mentioning

145

Contrasting

Unclassified

Order By: Relevance

“…Dudek et al (1992); MacCarthy and Liu (1993), and also McKay et al (2002) have criticised scheduling research in general and the flowshop scheduling literature in particular regarding this gap. Similar conclusions can be found in literature reviews (see Graves, 1981;Allahverdi et al, 1999;Linn and Zhang, 1999;Vignier et al, 1999;Ruiz and Vázquez Rodríguez, 2010;Ribas et al, 2010) on different scheduling environments. Reisman et al (1997) conducted a statistical review on flowshop sequencing/scheduling research between years 1952-1994.…”

Section: Motivation For This Phd Thesissupporting

confidence: 75%

“…One has to realise that multi-objective scheduling is far more complex than single-objective scheduling. In the multi-objective scheduling literature, hardly any research on hybrid flowshop problems can be found, as demonstrated in Ruiz and Vázquez Rodríguez (2010) and Ribas et al (2010). If we would have converted the complete problem of the previous chapters into a Pareto multi-objective problem, a sound basis would have been missing and the connection with existing literature would have been lost.…”

Section: Problem Descriptionmentioning

confidence: 99%

“…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). In jobshop problems, the machines of the set M are neither parallel, nor structured in stages.…”

Section: Motivation For This Phd Thesismentioning

confidence: 99%

See 2 more Smart Citations

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

Section: Motivation For This Phd Thesissupporting

confidence: 75%

Section: Problem Descriptionmentioning

confidence: 99%

See 1 more Smart Citation

Heuristics and metaheuristics for heavily constrained hybrid flowshop problems

Urlings¹

View full text Add to dashboard Cite

show abstract

“…In the FFS system, processing is divided into several stages with parallel resources at least in one stage. All of the tasks should pass through all stages in the same order (preparing meals) [5,6]. The exemplified objectives of the problem [6] are minimizing the total amount of time required to complete a group of jobs and minimizing the sum of differences between the completion time of a particular job in the group and the delivery time of this group containing that job (waiting period).…”

Section: Iiliterature Reviewmentioning

confidence: 99%

A hybrid method forOptimization Scheduling Groups of Jobs

Wikarek

Stefański

2017

Proceedings of the 2017 Federated Conference on Computer Science and Information Systems

View full text Add to dashboard Cite

“…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

229

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

Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective

Cited by 372 publications

References 154 publications

Heuristics and metaheuristics for heavily constrained hybrid flowshop problems

Heuristics and metaheuristics for heavily constrained hybrid flowshop problems

A hybrid method forOptimization Scheduling Groups of Jobs

A scatter search algorithm for the distributed permutation flowshop scheduling problem

Contact Info

Product

Resources

About