Minimizing makespan in hybrid flowshops

Lee, Chung‐Yee; Vairaktarakis, George L.

doi:10.1016/0167-6377(94)90026-4

Cited by 154 publications

(73 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…[115] also considers batch production allowing split on the single machine at stage 1 and proposed several heuristic methods. The same problem with two stages and identical machines in the first stage was studied by [109]. The authors proposed a fast heuristic running in O(n log n), derived error bounds and proposed some lower bounds.…”

Section: Heuristicsmentioning

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

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

680

236

View full text Add to dashboard Cite

show abstract

“…If τ j = 0 for each j, then the parallel flow shop problem with transportation times reduces to the hybrid flow shop problem, and our approximation algorithm has the same worst-case performance guarantee as the algorithms by Chen (1994) and Lee and Vairaktarakis (1994) when m=2. Figure 15: Cutting the Johnsonian schedule as prescribed in Lemma 13.…”

Section: Discussionmentioning

confidence: 99%

“…Note that if τ j = 0 for each J j , then the parallel flow shop problem with transportation times boils down to the hybrid flow shop problem. For the hybrid flow shop problem with m 1 = m 2 = 2, our approximation algorithm has the same worst-case performance ratio as the one by Chen (1994) and Lee and Vairaktarakis (1994). At the other extreme, if τ j = ∞ for each J j , then transfer between flow shops is effectively prohibited, and we have the original parallel flow shop problem.…”

mentioning

confidence: 97%

Approximation algorithms for the parallel flow shop problem

Zhang

Velde

2012

European Journal of Operational Research

View full text Add to dashboard Cite

We consider the N P-hard problem of scheduling n jobs in m two-stage parallel flow shops so as to minimize the makespan. This problem decomposes into two subproblems:assigning the jobs to parallel flow shops; and scheduling the jobs assigned to the same flow shop by use of Johnson's rule. For m = 2, we present a 3 2 -approximation algorithm, and for m = 3, we present a 12 7 -approximation algorithm. Both these algorithms run in O(n log n) time. These are the first approximation algorithms with fixed worst-case performance guarantees for the parallel flow shop problem.

show abstract

“…Várias pesquisas desse ambiente já foram reportadas, como as de Brah & Hunsucker (1991), Ding & Kittichartphayak (1994), Lee & Vairaktarakis (1994), Leon & Ramamoorthy (1997), Wittrock (1998) e Brah & Loo (1999).…”

Section: Programação Em Sistemas Flexible Flow Lineunclassified

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

Minimizing makespan in hybrid flowshops

Cited by 154 publications

References 18 publications

The hybrid flow shop scheduling problem

The hybrid flow shop scheduling problem

Approximation algorithms for the parallel flow shop problem

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

Contact Info

Product

Resources

About