A two-stage hybrid flowshop with uniform machines and setup times

Huang, Wentao; Li, S.

doi:10.1016/s0895-7177(97)00258-6

Cited by 27 publications

(12 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…They propose lower bounds, polynomial algorithms and metaheuristics. [79] study the uniform parallel machines case, but only at the second stage. They propose several heuristics.…”

Section: Heuristicsmentioning

confidence: 99%

“…||Cmax polynomial algorithm when m = 2, B&B and heuristics when m = 3 [68] F H2, ((1 (1) , P M (2) ))||Ū heuristics [72] F Hm, ((P M (k) ) m k=1 ))||Cmax heuristics [79] F H2, ((1 (1) , Q2 (2) ))||Cmax heuristics [101] F H2, ((P M (k) ) 2 k=1 ))||Cmax complex routings, heuristics [110] F H2, ((P 1 (1) , 1 (2) ))|assembly (2) |Cmax heuristics, also symmetric problem …”

Section: Research Opportunities and Conclusionmentioning

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

681

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

“…They propose lower bounds, polynomial algorithms and metaheuristics. [79] study the uniform parallel machines case, but only at the second stage. They propose several heuristics.…”

Section: Heuristicsmentioning

confidence: 99%

Section: Research Opportunities and Conclusionmentioning

confidence: 99%

The hybrid flow shop scheduling problem

Ruíz

Vázquez-Rodríguez

2010

European Journal of Operational Research

681

236

View full text Add to dashboard Cite

show abstract

“…O ambiente flow shop híbrido com dois estágios, sendo uma única máquina no primeiro e várias máquinas paralelas idênticas no segundo, com o critério de minimização do makespan, foi estudado por Gupta & Tunc (1994), Li (1997) e Huang & Li (1998).…”

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

“…Huang and Li (1998) contemplated the twostage problem with uniform machines in the second stage, whereas Dessouky et al (1998), Soewandi and Elmaghraby (2003), Kyparisis and Koulamas (2006a) considered uniform machines in both stages. The three stages problem has been investigated in Bertel and Billaut (2004).…”

Section: Introductionmentioning

confidence: 99%

No-wait flexible flowshop with uniform parallel machines and sequence-dependent setup time: a hybrid meta-heuristic approach

2013

View full text Add to dashboard Cite

According to the state of the art of no-wait scheduling problem, practitioners have mostly concentrated on pure no-wait flow shop scheduling problem. In the most real world production cases, flow shops operate with uniform parallel machines at each stage to eliminate or reduce the bottleneck stages with aim of enhancing the efficiency of production. This paper deals with a no-wait scheduling problem considering anticipatory sequence-dependent setup times on the flexible flow shop environment with uniform parallel machines. The objective is to find the sequence which minimizes maximum completion time of jobs (i.e. makespan). Since this problem is known to be NP-hard, we introduce a novel approach to tackle the problem. In the solution approach, firstly a heuristic formulation is used for objective function evaluation. Afterwards, principles of meta-heuristic algorithms namely invasive weed optimization, variable neighborhood search and simulated annealing algorithms are hybridized as solution method of the problem. In addition, a Taguchi method is employed for calibration of parameters and operators of the proposed hybrid metaheuristic. Various computational experiments in two scales of small and large are established to illustrate the effectiveness

show abstract

A two-stage hybrid flowshop with uniform machines and setup times

Cited by 27 publications

References 6 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

No-wait flexible flowshop with uniform parallel machines and sequence-dependent setup time: a hybrid meta-heuristic approach

Contact Info

Product

Resources

About