Development and analysis of production sequencing rules to minimize tardiness measures in flow shop with setup times
DOI:
https://doi.org/10.14488/1676-1901.v18i2.2819Keywords:
Scheduling. Flow shop. Tardiness. Priority rules. Sequence-independent setup times.Abstract
Priority rules are production scheduling methods with many advantages, among others, the easy implementation and simple understanding. Therefore, this study aims to develop new priority rules for minimizing tardiness measures in a flow shop environment with sequence-independent setup times. The total tardiness of the schedule, the maximum tardiness and the percent of tardy jobs were analyzed as measures of performance. The study considers a flow shop with m machines and n jobs, and thus presents results for different options of problem-size. The research also evidence results for the different scenarios that can be seen in production, according to a high or low tardiness factor and the amplitude of the due dates. The results were generated by computational experiments. Among the new priority rules proposed, SPT3 rule constitutes a new alternative sequencing of production, able to present greater success than the traditional EDD.Downloads
References
ARMENTANO, V.A.; RONCONI, D.P. Minimização do tempo total de atraso no problema de flow shop com buffer zero através de busca tabu. Gestão & Produção, v. 7, n. 3, p.352-363, 2000. DOI: http://dx.doi.org/10.1590/S0104-530X2000000300011
BARMAN, S. The impact of priority rule combinations on lateness and tardiness. IIE Transactions, v. 30, n. 5, p. 495-504, 1998. DOI: http://doi.org/10.1023/A:1007503508080
FERNANDES, S.C.; PIRES, T.A.; CAMARGO, V.H.C.; FUCHIGAMI, H.Y. Análise de desempenho de regras de prioridade para programação em flow shop com três máquinas, datas de liberação e tempos de setup dependentes da sequência. In: Encontro Nacional de Engenharia de Produção, 30, 2010, São Carlos. Anais. São Carlos: ENEGEP, 2010.
FUCHIGAMI, H.Y. Introdução ao Sequenciamento da Produção. Catalão: UFG, 2016. Material didático. Versão 7.0.
FUCHIGAMI, H.Y.; MOCCELLIN, J.V. Desempenho relative de regras de prioridade para programação de flow shop híbrido com tempos de setup. Produção Online, v. 15, n. 4, p. 1174-1194, 2015.DOI: http://dx.doi.org/10.14488/1676-1901.v15i4.1791
FUCHIGAMI, H.Y.; MOCCELLIN, J.V. Efeitos de regras de prioridade para programação da produção em sistemas industriais complexos. Produção Online, v. 16, n. 1, p. 3-25, 2016. DOI: http://dx.doi.org/10.14488/1676-1901.v15i4.1791
HAUPT, R. A survey of priority rule-based scheduling. OR Spektrum, v. 11, p. 3-16, 1989. DOI: https://doi.org/10.1007/BF01721162
JAYAMOHAN, M.; RAJENDRAN, C. New dispatching rules for shop scheduling: a step forward. International Journal of Production Research, v. 38, n. 3, p. 563-586, 2000. DOI: http://dx.doi.org/10.1080/002075400189301
JUNG, C. F. Metodologia para pesquisa & desenvolvimento: aplicada a novas tecnologias, produtos e processos. Rio de Janeiro: Axcel Books, 2004.
MARTINS, R.A. Abordagens Quantitativa e Qualitativa. In: MIGUEL, P.A.C.(Org.). Metodologia de pesquisa em Engenharia de Produção e Gestão de Operações. Rio de Janeiro: Elsevier, 2010. p. 45-61, cap.3.
MOCCELLIN, J.; NAGANO, M. Heuristic for flow shop sequencing with separated and sequence independent setup times. Journal of the Brazilian Society of Mechanical Sciences and Engineering, v. 33, n. 1, p. 74-78, 2011. DOI: http://dx.doi.org/10.1590/S1678-58782011000100011
MOCCELLIN, J.; NAGANO, M. Uma propriedade estrutural do problema de programação da produção flow shop permutacional com tempos de setup. Pesquisa Operacional, v. 27, n. 3, p. 487-515, 2007. DOI: http://dx.doi.org/10.1590/S0101-74382007000300005
NAKANO, D. Métodos de Pesquisa Adotados na Engenharia de Produção e Gestão de Operações. In: MIGUEL, P.A.C.(Org.). Metodologia de pesquisa em Engenharia de Produção e Gestão de Operações. Rio de Janeiro: Elsevier, 2010. p. 63-72, cap.4.
PINEDO, M. L. Scheduling: theory, algorithms and systems. New York: Springer, 2016, 5th ed.
RONCONI, D.P.; BIRGIN, E.G. Mixed-integer programming models for flow shop scheduling problems minimizing the total earliness and tardiness. In Just-in-Time Systems, Y.A. Ríos-Solís and R.Z. Ríos-Mercado (Eds.), Springer Series on Optimization and Its Applications, P.M. Pardalos and Ding-Zhu Du (Series eds.). 2012.
TAILLARD, E. Benchmarks for basic scheduling problems. European Journal of Operational Research, v. 64, p. 278-285, 1993. DOI: https://doi.org/10.1016/0377-2217(93)90182-M
Published
How to Cite
Issue
Section
License
The Journal reserves the right to make spelling and grammatical changes, aiming to keep a default language, respecting, however, the style of the authors.
The published work is responsibility of the (s) author (s), while the Revista Produção Online is only responsible for the evaluation of the paper. The Revista Produção Online is not responsible for any violations of Law No. 9.610 / 1998, the Copyright Act.
The journal allows the authors to keep the copyright of accepted articles, without restrictions
This work is licensed under a Creative Commons License .
