Revisión de la Literatura sobre el Problema de Programación de “Flow Shop” Híbrido con Máquinas Paralelas no Relacionadas

Literature Review on the Hybrid Flow Shop Scheduling Problem with Unrelated Parallel Machines

  • Eliana Marcela Peña Tibaduiza Universidad Industrial de Santander
  • Edwin Alberto Garavito Hernández Universidad Industrial de Santander
  • Luis Eduardo Pérez Figueredo Universidad Industrial de Santander
  • Eslendis Moratto Chimenty Universidad Industrial de Santander
Palabras clave: Hybrid flow shop, unrelated parallel machine, literature review, scheduling (en_US)
Palabras clave: “flow shop” híbrido, máquinas paralelas no relacionadas, revisión de la literatura, programación (es_ES)

Resumen (es_ES)

Contexto: se ha observado que el problema de flow shop híbrido con máquinas paralelas no relacionadas presenta escasos reportes en el ámbito académico, en comparación con el flow shop híbrido que considera procesadores idénticos, razón por la cual son poco conocidos los diferentes enfoques y aplicaciones que este problema puede tener.

Método: se realizó una revisión de la literatura del estado del arte del problema de programación de trabajos en un flow shop híbrido mediante la recopilación y análisis de artículos académicos en diversas bases de datos científicas. Con este propósito se realizó una búsqueda a partir de palabras claves que definen el problema, revisando si evidencian en la descripción del problema la existencia de máquinas paralelas no relacionadas; como resultado se obtienen 50 artículos seleccionados para el presente estudio.

Resultados: se realizó una clasificación del problema de acuerdo a las características del sistema productivo y se presentan los métodos de solución, restricciones y funciones objetivo comúnmente utilizadas.

Conclusiones: se observa una tendencia creciente en los estudios del flow shop con múltiples etapas, pero pocos son los estudios basados en casos de la industria.

Resumen (en_US)

Context: The flow shop hybrid problem with unrelated parallel machines has been less studied in the academia compared to the flow shop hybrid with identical processors. For this reason, there are few reports about the kind of application of this problem in industries.

Method: A literature review of the state of the art on flow-shop scheduling problem was conducted by collecting and analyzing academic papers on several scientific databases. For this aim, a search query was constructed using keywords defining the problem and checking the inclusion of unrelated parallel machines in such definition; as a result, 50 papers were finally selected for this study.

Results: A classification of the problem according to the characteristics of the production system was performed, also solution methods, constraints and objective functions commonly used are presented.

Conclusions: An increasing trend is observed in studies of flow shop with multiple stages, but few are based on industry case-studies.

Descargas

La descarga de datos todavía no está disponible.

Referencias

Imma Ribas, Rainer Leisten, y Jose. M. Framiñan, “Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective,” Comput. Oper. Res., vol. 37, no. 8,2010, pp. 1439–1454.

Marcia de Fatima Morais, Thays. J. Perassoli , Leandro dos Santos, Rony Peterson, y Paulo Paraíso, “Multicriteria Hybrid Flow Shop Scheduling Problem: Literature Review, Analysis, and Future Research,” Indep. J. Manag. Prod., vol. 5, no. 4, pp. 2014, 1004–1031.

Wenpeng Wang, “Review on hybrid flow shop scheduling,” Int. Conf. Inf. Technol. Comput. Eng. Manag. Sci. ICM 2011, vol. 4, 2011 pp. 7–10. 2011.

Ruben Ruiz y Jose Vázquez, “The hybrid flow shop scheduling problem,” Eur. J. Oper. Res., vol. 205, no. 1,2010, pp. 1–18.

James Lin y Chien Chen, “Simulation optimization approach for hybrid flow shop scheduling problem in semiconductor back-end manufacturing,” Simul. Model. Pract. Theory, vol. 51, 2015, pp. 100–114.

Ewa Figielska, “A new heuristic for scheduling the two-stage flowshop with additional resources,” Comput. Ind. Eng., vol. 54, no. 4, 2008pp. 750–763.

Marco Pautasso, “Ten simple rules for writing a literature review,” PLoS Comput. Biol., vol. 9, no. 7, 2013, pp. 1–4.

Cesar Pineda y Cesar López, "Una revisión al estado del arte de la integración de toma de decisiones en la red logística", Ingeniería, vol. 18, Num. 1, pp 118-148.

Juan D. Velásquez, "Una Guía Corta para Escribir Revisiones Sistemáticas de Literatura Parte 1." Dyna 81.187, 2014, pp9-10.

Ewa Figielska, “A genetic algorithm and a simulated annealing algorithm combined with column generation technique for solving the problem of scheduling in the hybrid flowshop with additional resources,” Comput. Ind. Eng., vol. 56, no. 1, 2009, pp. 142–151.

Ewa Figielska, “Heuristic algorithms for preemptive scheduling in a two-stage hybrid flowshop with additional renewable resources at each stage,” Comput. Ind. Eng., vol. 59, no. 4, 2010, pp. 509–519.

Ewa Figielska, “A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages,” Eur. J. Oper. Res., vol. 236, no. 2, 2014, pp. 433–444.

Jitti Jungwattanakit, Manop Reodecha, Paveena. Chaovalitwongse y Frank. Werner, “Constructive and simulated annealing heuristics for hybrid flow shops with unrelated parallel machines,” in Proceedings of the 3rd OR-CRN Operations Research Conference, Bangkok, Thailand, 2006, pp. 110–121.

Jitti Jungwattanakit, Manop Reodecha, Paveena Chaovalitwongse, y Frank Werner, “Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria,” Int. J. Adv. Manuf. Technol., vol. 37, no. 3–4, 2008, pp. 354–370.

Jitti Jungwattanakit, Manop Reodecha, P Chaovalitwongse, y Frank Werner, “A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria,” Comput. Oper. Res., vol. 36, no. 2, 2009, pp. 358–378.

Richard Linn y Wei Zhang, “Hybrid flow shop scheduling: a survey,” Comput. Ind. Eng., vol. 37, no. 1, 1999, pp. 57–61.

Toshifumi Uetake, Hitoshi Tsubone, y Masaaki Ohba, “A production scheduling system in a hybrid flow shop,” Int. J. Prod. Econ., vol. 41, no. 1–3, 1995, pp. 395–398.

Christian Almeder y Richard Hartl, “A metaheuristic optimization approach for a real-world stochastic flexible flow shop problem with limited buffer,” Int. J. Prod. Econ., vol. 145, no. 1, 2013, pp. 88–95.

Chinyao Low, Chou Hsu, y Chwen Su, “A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines,” Comput. Oper. Res., vol. 35, no. 3, 2008, pp. 845–853.

M. Rabiee, R. Sadeghi Rad, M. Mazinani, y R. Shafaei, “An intelligent hybrid meta-heuristic for solving a case of no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines,” Int. J. Adv. Manuf. Technol., vol. 71, no. 5–8, 2014, pp. 1229–1245.

Victor Yaurima, Larisa Burtseva, y Andrei Tchernykh, “Hybrid Flowshop with Unrelated Machines , Sequence Dependent Setup Time and Availability Constraints : An Enhanced Crossover Operator for a Genetic Algorithm,” Springer verlag Berlin Heidelberg, 2008, pp. 608–617.

Victor Yaurima, Larisa Burtseva, y Andrei Tchernykh, “Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers,” Comput. Ind. Eng., vol. 56, no. 4, 2009, pp. 1452–1463.

Zhan Tao Li, Jianjun Liu, Qing Chen, Ning Mao, and Xiaoming Wang, “Approximation algorithms for the three-stage flexible flow shop problem with mid group constraint,” Expert Syst. Appl., vol. 42, no. 7, 2015, pp. 3571–3584.

Marcelo Seido Nagano, “Flowshops Paralelos Com Processadores Não-Relacionados,” XXII Encontro Nacional de Engenharia de Produção, 2002, pp. 1–8.

Chinyao Low, “Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines,” Comput. Oper. Res., vol. 32, no. 8, 2005, pp. 2013–2025.

Ruben Ruiz, Funda Şerifoğlu y Thijs Urlings, “Modeling realistic hybrid flexible flowshop scheduling problems,” Comput. Oper. Res., vol. 35, no. 4, 2008, pp. 1151–1175.

M. Zandieh, E. Mozaffari y M. Gholami, “A robust genetic algorithm for scheduling realistic hybrid flexible flow line problems,” J. Intell. Manuf., vol. 21, no. 6, 2010, pp. 731–743.

Mir Abbas Bozorgirad y Rasaratnam Logendran, “Hybrid flowshop scheduling problem with a bi-criteria objective and group technology assumption,” in IIE Annual Conference. Proceedings, 2013, p. 3004.

S. F. Attar, M. Mohammadi y R. Tavakkoli-Moghaddam, “Hybrid flexible flowshop scheduling problem with unrelated parallel machines and limited waiting times,” Int. J. Adv. Manuf. Technol., vol. 68, no. 5–8, 2013, pp. 1583–1599.

Eduardo Camargo, Sergio de Souza y Marcone Jamilson,“Um algoritmo iterated greedy search aplicado à minimização do makespan ”, Simpósio Brasileiro de pesquisa operacional, 2013, pp. 44–55.

Zhan Tao Li, Qing Chen, Ning Mao, Xiaoming Wang y Jianjun. Liu, “Scheduling rules for two-stage flexible flow shop scheduling problem subject to tail group constraint,” Int. J. Prod. Econ., vol. 146, no. 2, 2013, pp. 667–678.

Jaime Arango, Jaime Giraldo y Omar Castrillón, “Aplicando la Heurística TOC a la Secuenciación de Trabajos en un Flow Shop Híbrido Flexible,” Dyna, vol. 81, no. 2011, 2014, pp. 113–119.

H.-W. Kim y D.-H. Lee, “Heuristic algorithms for re-entrant hybrid flow shop scheduling with unrelated parallel machines,” Proc. Inst. Mech. Eng. Part B J. Eng. Manuf., vol. 223, no. 4, 2009, pp. 433–442 .

Abolfazl Soltani y Behrooz Karimi, “Cyclic hybrid flow shop scheduling problem with limited buffers and machine eligibility constraints,” Int. J. Adv. Manuf. Technol., vol. 76, no. 9–12, 2014, pp. 1739–1755.

Omar Castrillón, Jaime Giraldo, y W. Sarache, “Técnicas inteligentes y estocásticas en scheduling,” Un enfoque en la Prod. y las operaciones. Unibiblios, Bogotá, 2010.

Ruben Ruiz y Concepción Maroto, “A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility,” Eur. J. Oper. Res., vol. 169, no. 3, 2006, pp. 781–800.

Pedro Gómez, “Un nuevo Algoritmo Genético Basado en un Sistema Multiagente para la Programación de la Producción en un Taller de Flujo Híbrido,” Internacional Conference on Industrial Engineering & Industrial Management, 2007, pp. 1675–1685.

E. Rashidi, M. Jahandar y M. Zandieh, “An improved hybrid multi-objective parallel genetic algorithm for hybrid flow shop scheduling with unrelated parallel machines,” Int. J. Adv. Manuf. Technol., vol. 49, no. 9–12, 2010, pp. 1129–1139.

Fantahun Defersha y Mingyuan Chen, “Mathematical model and parallel genetic algorithm for hybrid flexible flowshop lot streaming problem,” Int. J. Adv. Manuf. Technol., vol. 62, no. 1–4, 2012, pp. 249–265.

Pedro Gómez, Carlos Andrés y Francisco Lario, “An agent-based genetic algorithm for hybrid flowshops with sequence dependent setup times to minimise makespan,” Expert Syst. Appl., vol. 39, no. 9, 2012, pp. 8095–8107.

Pedro Luis Miranda y Rodolfo Florence Teixeira Jr, “Algoritmo genético com busca local para a programação da produção em sistemas flow-shop híbridos,” Congreso Latino-iberoamericano de Investigación Operativa, 2012, pp. 19-29.

Pedro Luis Miranda, Karim Martínez y Rodolfo Florence Teixeira Jr, “um modelo de programação inteira mista para a programação da produção em flowshop híbrido com buffers limitados,”, Simpósio Brasileiro de Pesquisa Operacional, 2013, pp. 154-165.

M. Jenabi, S. M. T. Fatemi Ghomi, S. a. Torabi, y B. Karimi, “Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with 3

Ye Xu, Ling Wang, Gang Zhou y Shengyao Wang, “An effective shuffled frog leaping algorithm for solving hybrid flow-shop scheduling problem,” Lect. Notes Comput. Sci. (including Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinformatics), vol. 6838 LNCS, 2011, pp. 560–567.

Jun-qing. Li y Quan-ke Pan, “Solving the large-scale hybrid flow shop scheduling problem with limited buffers by a hybrid artificial bee colony

B. Scholz-Reiter, H. Rekersbrink, and M. Görges, “Dynamic flexible flow shop problems - Scheduling heuristics vs. autonomous control,” CIRP Ann. - Manuf. Technol., vol. 59, no. 1, 2010, pp. 465–468.

Javier Parra Peña y Gónzalo Mejia, “Desarrollo de un modelo para la secuenciación de trabajos en la mediana industria ladrillera de la localidad XIX", "Tesis M.S.", Unidandes, Colombia, 2006.

Min Dai, Dunbing Tang, Adriana Giret, M. Salido, y W. D. Li, “Energy-efficient scheduling for a flexible flow shop using an improved genetic-simulated annealing algorithm,” Robot. Comput. Integr. Manuf., vol. 29, no. 5, 2013, pp. 418–429.

Catarina Dudas, Marcus Frantzén y Amos HC. NG., “A synergy of multi-objetive optimization and data mining for analysis of a flexible flow shop", Robotics and Computer-Integrated Manufacturing, vol. 27, no 4, 2011, pp. 687-695.

Ruben Ruiz y Concepción Maroto, “Evaluación de Heurísticas para el Problema del Taller de Flujo,” in 27 Congreso Nacional de Estadística e Investigación Operativa, 2003, pp. 1–18.

Orlando Suarez, “Una aproximación a la heuristica y metaheuristicas,” INGE@ UAN, Tendencias en la Ing., vol. 1, no. 2, 2013, pp. 44-51.

Jose Francisco Chicano “Metaheurísticas e ingeniería del software”, Tesis Doctoral, Lenguajes y Ciencias de la Computación, Universidad de Málaga, Málaga, España, 2007.

Sungbum Jun y Jinwoo Park, “A hybrid genetic algorithm for the hybrid flow shop scheduling problem with nighttime work and simultaneous work constraints: A case study from the transformer industry,” Expert Syst. Appl., vol. 42, no. 15, 2015, pp. 6196–6204.

Sahar Safaei, Reihane Naderi, Amir Sohrabi y Amin Hatami, " Scheduling of Unrelated Parallel Machines using Two Multi Objective Genetic Algorithms with Sequence-Dependent Setup Times and Precedent Constraints." International Journal of Advanced Design and Manufacturing Technology vol. 8, no 4, 2016. ISSN 2383-4447. Available at: <http://admt.iaumajlesi.ac.ir/index/index.php/me/article/view/983>. Date accessed: 28 june 2016.

Cómo citar
Peña Tibaduiza, E. M., Garavito Hernández, E. A., Pérez Figueredo, L. E., & Moratto Chimenty, E. (2017). Revisión de la Literatura sobre el Problema de Programación de “Flow Shop” Híbrido con Máquinas Paralelas no Relacionadas. Ingeniería, 22(1), 46-64. https://doi.org/10.14483/udistrital.jour.reving.2017.1.a03
Publicado: 2017-01-30
Sección
Ingeniería Industrial