CONWIP FLOW SHOP BACKLOG SEQUENCING PROBLEM WITH RANDOM PROCESSING TIMES

Vol 55, 2023 - 160982
Trabalho completo (oral)
Favoritar este trabalho
Como citar esse trabalho?
Resumo

This paper addresses the backlog sequencing problem in a flow shop controlled by a ConWiP production control model when processing times are random, and the objective is to minimize the expected makespan. For this problem, we evaluated the performance of two constructive heuristics: a deterministic heuristic applied to mean processing times and a heuristic designed specifically for the stochastic problem. We use simulation to estimate the expected makespan. In general, stochastic heuristic perform better than deterministic heuristic applied to mean processing times. However, this difference does not justify the computational cost of stochastic heuristic, at least within the limits of our experiments. Therefore, a more practical way to deal the stochastic problem is to resolve the deterministic counterpart, since it provides good sequences in reasonable computational time.

Compartilhe suas ideias ou dúvidas com os autores!

Sabia que o maior estímulo no desenvolvimento científico e cultural é a curiosidade? Deixe seus questionamentos ou sugestões para o autor!

Faça login para interagir

Tem uma dúvida ou sugestão? Compartilhe seu feedback com os autores!

Instituições
  • 1 Universidade Federal Rural do Semi-Árido
  • 2 Universidade de São Paulo
Eixo Temático
  • 14. OC – Otimização Combinatória
Palavras-chave
Backlog sequencing; Stochastic flow shop ConWiP; Optimization and simulation