Heuristic for flow shop sequencing with separated and sequence independent setup times

Moccellin, João Vitor; Nagano, Marcelo Seido

doi:10.1590/s1678-58782011000100011

Cited by 3 publications

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, this assumption leads to problems in the scheduling process. Therefore, an explicit consideration for setup times has been considered [10,12].…”

Section: Introductionmentioning

confidence: 99%

Heuristic algorithms for scheduling hybrid flow shops with machine blocking and setup times

Moccellin

Nagano

Pitombeira‐Neto

et al. 2018

J Braz. Soc. Mech. Sci. Eng.

Self Cite

View full text Add to dashboard Cite

We investigate a new variant of the hybrid flow shop problem (HFSP) considering machine blocking and both sequenceindependent and sequence-dependent setup times. Since the HFSP is NP-hard, we propose heuristic algorithms along with priority rules based on the traditional SPT and LPT rules. We carried out computational experiments on simulated problem instances to test the performance of the priority rules. The objective function adopted was makespan minimization, and we used the rate of success and the relative deviation as performance criteria. The results indicate superiority of LPT-based rules. On instances with sequence-independent setup times, the LP rule, which is based on the non-increasing sorting of total processing times, outperformed other rules in most tested instances. In instances with sequence-dependent setup times, the LPS rule, which is based on the non-increasing sum of processing time and average setup times, outperformed other rules in most tested instances.

show abstract

“…However, this assumption leads to problems in the scheduling process. Therefore, an explicit consideration for setup times has been considered [10,12].…”

Section: Introductionmentioning

confidence: 99%

Heuristic algorithms for scheduling hybrid flow shops with machine blocking and setup times

Moccellin

Nagano

Pitombeira‐Neto

et al. 2018

J Braz. Soc. Mech. Sci. Eng.

Self Cite

View full text Add to dashboard Cite

show abstract

A novel hybrid genetic algorithm to solve the sequence-dependent permutation flow-shop scheduling problem

Mirabi

2013

Int J Adv Manuf Technol

View full text Add to dashboard Cite

Desenvolvimento e análise de regras de sequenciamento da produção para minimização de medidas de atraso em flow shop com tempos de setup

Silva

Fuchigami

2018

Revista PO: R. Eletr. de Eng. de Produção e Correlatas

View full text Add to dashboard Cite

As regras de sequenciamento são métodos de programação da produção que possuem como vantagens, dentre outras, sua fácil implementação e simples compreensão. Neste sentido, este trabalho tem como objetivo o desenvolvimento de novas regras de sequenciamento para a minimização de medidas de atraso em um ambiente flow shop com setup independente da sequência. Foram analisadas, como medidas de desempenho, o atraso total da programação, o atraso máximo e o número de tarefas atrasadas. O estudo considera um flow shop com m máquinas e n tarefas, e, portanto, traz resultados para diferentes ambientes (relacionados ao porte do problema). A pesquisa traz resultados também em relação aos diferentes cenários que se pode observar na produção, de acordo com um alto ou baixo fator de atraso e com a amplitude da faixa de datas de entrega. Os resultados foram gerados através da experimentação computacional. Dentre as novas regras de prioridade propostas, destacam-se os resultados obtidos pela regra SPT3, constituindo uma nova alternativa de sequenciamento da produção, capaz de apresentar melhor desempenho que a regra clássica EDD.

show abstract

Heuristic for flow shop sequencing with separated and sequence independent setup times

Cited by 3 publications

References 16 publications

Heuristic algorithms for scheduling hybrid flow shops with machine blocking and setup times

Heuristic algorithms for scheduling hybrid flow shops with machine blocking and setup times

A novel hybrid genetic algorithm to solve the sequence-dependent permutation flow-shop scheduling problem

Desenvolvimento e análise de regras de sequenciamento da produção para minimização de medidas de atraso em flow shop com tempos de setup

Contact Info

Product

Resources

About