Comparing scheduling rules for flexible flow lines

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

“…The proposed RKGA outperformed several other specialized heuristics including those of [104]. In [139], a multi-processor problem was considered.…”

Section: Metaheuristicsmentioning

confidence: 99%

The hybrid flow shop scheduling problem

Ruíz

Vázquez-Rodríguez

2010

European Journal of Operational Research

646

236

View full text Add to dashboard Cite

show abstract

“…Diversos trabalhos enfocaram ambientes multiestágio híbridos com tempos de setup dependentes da sequência, considerando diferentes técnicas de solução, como os de Kurz & Askin (2003, Tang Os trabalhos reportados na literatura envolvendo especificamente tempos de setup independentes da sequência estão relacionados a seguir.…”

Section: Regras De Prioridade Propostasunclassified

Novas regras de prioridade para programação em flexible flow line com tempos de setup explícitos

Fuchigami

Moccellin

Ruíz

2015

Prod.

View full text Add to dashboard Cite

ResumoNeste artigo são propostos e avaliados 12 métodos para minimização da duração total da programação (makespan) em sistemas flexible flow line com tempos de setup independentes da sequência de execução das tarefas. Esse ambiente é caracterizado pela possibilidade de as tarefas saltarem um ou mais estágios de produção. Além disso, os tempos de setup podem ou não ser antecipados. Os desempenhos relativos dos métodos de solução foram avaliados por meio de experimentação computacional com base na porcentagem de sucesso, desvio relativo, desvio-padrão do desvio relativo e tempo médio de computação. Para avaliar-se a qualidade da solução dos métodos propostos, foi desenvolvido um limitante inferior (lower bound) para a função objetivo. Testes computacionais mostraram a maior eficácia do método que sequencia as tarefas no primeiro estágio, pela ordem decrescente da soma dos tempos de processamento e de setup de todos os estágios, e nos estágios seguintes, pela ordem em que as tarefas são liberadas para o processamento. Palavras-chaveProgramação da produção. Flexible flow line. Setup independente.

show abstract

“…Kurz and Askin (2003) consider dispatching rules for the SDST/HFFS. They investigate three classes of heuristics based on simple greedy methods, insertion heuristics and adaptations of the Johnson's rule.…”

Section: Literature Review Of Sdst Hybrid Flexible Flowshopsmentioning

confidence: 99%

“…Setup times are only realized once jobs are assigned, instead of actively searching for small setups. Clear examples are the heuristics and the RKGA of Kurz and Askin (2003) and Kurz and Askin (2004).…”

Section: Modified Dynamic Dispatching Rule Heuristicmentioning

confidence: 99%

“…In any case, it is unlikely that any such approaches will be able to solve large instances, given the abundant literature on exact methods for simpler problems with setup times and the limited results obtained so far. However, some heuristics and metaheuristics have been proposed for this problem like random keys genetic algorithms and heuristics, Kurz and Askin (2003), Kurz and Askin (2004), genetic algorithms , and artificial immune systems Zandieh, Ghomi and Husseini (2006). In this paper we exploit the flexible and setup time characteristics of the SDST/HFFS in order to obtain competitive results.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Algorithms for a realistic variant of flowshop scheduling

Naderi

Ruíz

Zandieh

2010

Computers & Operations Research

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

Comparing scheduling rules for flexible flow lines

Cited by 115 publications

References 30 publications

The hybrid flow shop scheduling problem

The hybrid flow shop scheduling problem

Novas regras de prioridade para programação em flexible flow line com tempos de setup explícitos

Algorithms for a realistic variant of flowshop scheduling

Contact Info

Product

Resources

About