- -

Novas regras de prioridade para programação em flexible flow line com tempos de setup explícitos

RiuNet: Repositorio Institucional de la Universidad Politécnica de Valencia

Compartir/Enviar a

Citas

Estadísticas

  • Estadisticas de Uso

Novas regras de prioridade para programação em flexible flow line com tempos de setup explícitos

Mostrar el registro sencillo del ítem

Ficheros en el ítem

Thumbnail
Nombre: -Ruiz - Novas regras ...
Tamaño: 1.432Mb
Formato: PDF
Descripción: Versión del Editor
Abrir
dc.contributor.author Yochihiro Fuchigamia, Hélio es_ES
dc.contributor.author Moccellin, João Vitor es_ES
dc.contributor.author Ruiz García, Rubén es_ES
dc.date.accessioned 2016-04-26T14:21:04Z
dc.date.available 2016-04-26T14:21:04Z
dc.date.issued 2015-10
dc.identifier.issn 1676-1901
dc.identifier.uri http://hdl.handle.net/10251/62984
dc.description This is an open-access article distributed under the terms of the Creative Commons Attribution License. Atribuição 4.0 Internacional (CC BY 4.0) es_ES
dc.description.abstract Neste 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. es_ES
dc.language Portugués es_ES
dc.publisher Universidade Federal de Santa Catarina es_ES
dc.relation.ispartof Revista Produção Online es_ES
dc.rights Reconocimiento (by) es_ES
dc.subject Programação da produção es_ES
dc.subject Flexible flow line es_ES
dc.subject Setup independente es_ES
dc.subject.classification ESTADISTICA E INVESTIGACION OPERATIVA es_ES
dc.title Novas regras de prioridade para programação em flexible flow line com tempos de setup explícitos es_ES
dc.title.alternative New priority rules for the flexible flow line scheduling problem with setup times es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.1590/0103-6513.089212
dc.rights.accessRights Abierto es_ES
dc.contributor.affiliation Universitat Politècnica de València. Departamento de Estadística e Investigación Operativa Aplicadas y Calidad - Departament d'Estadística i Investigació Operativa Aplicades i Qualitat es_ES
dc.description.bibliographicCitation Yochihiro Fuchigamia, H.; Moccellin, JV.; Ruiz García, R. (2015). Novas regras de prioridade para programação em flexible flow line com tempos de setup explícitos. Revista Produção Online. 25(4):779-790. doi:10.1590/0103-6513.089212 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion http://dx.doi.org/10.1590/0103-6513.089212 es_ES
dc.description.upvformatpinicio 779 es_ES
dc.description.upvformatpfin 790 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 25 es_ES
dc.description.issue 4 es_ES
dc.relation.senia 308917 es_ES
dc.description.references Aldowaisan, T. (2001). A new heuristic and dominance relations for no-wait flowshops with setups. Computers & Operations Research, 28(6), 563-584. doi:10.1016/s0305-0548(99)00136-7 es_ES
dc.description.references Allahverdi, A. (2000). Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times. Computers & Operations Research, 27(2), 111-127. doi:10.1016/s0305-0548(99)00010-6 es_ES
dc.description.references Allahverdi, A., Gupta, J. N. ., & Aldowaisan, T. (1999). A review of scheduling research involving setup considerations. Omega, 27(2), 219-239. doi:10.1016/s0305-0483(98)00042-5 es_ES
dc.description.references Allaoui, H., & Artiba, A. (2004). Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints. Computers & Industrial Engineering, 47(4), 431-450. doi:10.1016/j.cie.2004.09.002 es_ES
dc.description.references Andrés, C., Albarracı́n, J. M., Tormo, G., Vicens, E., & Garcı́a-Sabater, J. P. (2005). Group technology in a hybrid flowshop environment: A case study. European Journal of Operational Research, 167(1), 272-281. doi:10.1016/j.ejor.2004.03.026 es_ES
dc.description.references Botta-Genoulaz, V. (2000). Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness. International Journal of Production Economics, 64(1-3), 101-111. doi:10.1016/s0925-5273(99)00048-1 es_ES
dc.description.references Brah, S. A., & Hunsucker, J. L. (1991). Branch and bound algorithm for the flow shop with multiple processors. European Journal of Operational Research, 51(1), 88-99. doi:10.1016/0377-2217(91)90148-o es_ES
dc.description.references Brah, S. A., & Loo, L. L. (1999). Heuristics for scheduling in a flow shop with multiple processors. European Journal of Operational Research, 113(1), 113-122. doi:10.1016/s0377-2217(97)00423-2 es_ES
dc.description.references Ding, F.-Y., & Kittichartphayak, D. (1994). Heuristics for scheduling flexible flow lines. Computers & Industrial Engineering, 26(1), 27-34. doi:10.1016/0360-8352(94)90025-6 es_ES
dc.description.references Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The Complexity of Flowshop and Jobshop Scheduling. Mathematics of Operations Research, 1(2), 117-129. doi:10.1287/moor.1.2.117 es_ES
dc.description.references Gupta, J. N. D., & Tunc, E. A. (1994). Scheduling a two-stage hybrid flowshop with separable setup and removal times. European Journal of Operational Research, 77(3), 415-428. doi:10.1016/0377-2217(94)90407-3 es_ES
dc.description.references Huang, W., & Li, S. (1998). A two-stage hybrid flowshop with uniform machines and setup times. Mathematical and Computer Modelling, 27(2), 27-45. doi:10.1016/s0895-7177(97)00258-6 es_ES
dc.description.references Jenabi, M., Fatemi Ghomi, S. M. T., Torabi, S. A., & Karimi, B. (2007). Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines. Applied Mathematics and Computation, 186(1), 230-245. doi:10.1016/j.amc.2006.06.121 es_ES
dc.description.references Jungwattanakit, J., Reodecha, M., Chaovalitwongse, P., & Werner, F. (2007). Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria. The International Journal of Advanced Manufacturing Technology, 37(3-4), 354-370. doi:10.1007/s00170-007-0977-0 es_ES
dc.description.references Kis, T., & Pesch, E. (2005). A review of exact solution methods for the non-preemptive multiprocessor flowshop problem. European Journal of Operational Research, 164(3), 592-608. doi:10.1016/j.ejor.2003.12.026 es_ES
dc.description.references Kurz, M. E., & Askin, R. G. (2003). Comparing scheduling rules for flexible flow lines. International Journal of Production Economics, 85(3), 371-388. doi:10.1016/s0925-5273(03)00123-3 es_ES
dc.description.references Kurz, M. E., & Askin, R. G. (2004). Scheduling flexible flow lines with sequence-dependent setup times. European Journal of Operational Research, 159(1), 66-82. doi:10.1016/s0377-2217(03)00401-6 es_ES
dc.description.references Lee, C.-Y., & Vairaktarakis, G. L. (1994). Minimizing makespan in hybrid flowshops. Operations Research Letters, 16(3), 149-158. doi:10.1016/0167-6377(94)90026-4 es_ES
dc.description.references LEON, V. J., & RAMAMOORTHY, B. (1997). An adaptable problem-space-based search method for flexible flow line scheduling. IIE Transactions, 29(2), 115-125. doi:10.1080/07408179708966319 es_ES
dc.description.references Li, S. (1997). A hybrid two-stage flowshop with part family, batch production, major and minor set-ups. European Journal of Operational Research, 102(1), 142-156. doi:10.1016/s0377-2217(96)00213-5 es_ES
dc.description.references Linn, R., & Zhang, W. (1999). Hybrid flow shop scheduling: A survey. Computers & Industrial Engineering, 37(1-2), 57-61. doi:10.1016/s0360-8352(99)00023-6 es_ES
dc.description.references Chung-Yang Liu, & Shi-Chung Chang. (2000). Scheduling flexible flow shops with sequence-dependent setup effects. IEEE Transactions on Robotics and Automation, 16(4), 408-419. doi:10.1109/70.864235 es_ES
dc.description.references Logendran, R., Carson, S., & Hanson, E. (2005). Group scheduling in flexible flow shops. International Journal of Production Economics, 96(2), 143-155. doi:10.1016/j.ijpe.2004.03.011 es_ES
dc.description.references Low, C. (2005). Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines. Computers & Operations Research, 32(8), 2013-2025. doi:10.1016/j.cor.2004.01.003 es_ES
dc.description.references Naderi, B., Ruiz, R., & Zandieh, M. (2010). Algorithms for a realistic variant of flowshop scheduling. Computers & Operations Research, 37(2), 236-246. doi:10.1016/j.cor.2009.04.017 es_ES
dc.description.references Quadt, D., & Kuhn, H. (2007). A taxonomy of flexible flow line scheduling procedures. European Journal of Operational Research, 178(3), 686-698. doi:10.1016/j.ejor.2006.01.042 es_ES
dc.description.references Quadt, D., & Kuhn, H. (2007). Batch scheduling of jobs with identical process times on flexible flow lines. International Journal of Production Economics, 105(2), 385-401. doi:10.1016/j.ijpe.2004.04.013 es_ES
dc.description.references Ribas, I., Leisten, R., & Framiñan, J. M. (2010). Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Computers & Operations Research, 37(8), 1439-1454. doi:10.1016/j.cor.2009.11.001 es_ES
dc.description.references Ruiz, R., & Maroto, C. (2006). A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. European Journal of Operational Research, 169(3), 781-800. doi:10.1016/j.ejor.2004.06.038 es_ES
dc.description.references Ruiz, R., & Vázquez-Rodríguez, J. A. (2010). The hybrid flow shop scheduling problem. European Journal of Operational Research, 205(1), 1-18. doi:10.1016/j.ejor.2009.09.024 es_ES
dc.description.references Ruiz, R., Şerifoğlu, F. S., & Urlings, T. (2008). Modeling realistic hybrid flexible flowshop scheduling problems. Computers & Operations Research, 35(4), 1151-1175. doi:10.1016/j.cor.2006.07.014 es_ES
dc.description.references Tang, L., & Zhang, Y. (2005). Heuristic Combined Artificial Neural Networks to Schedule Hybrid Flow Shop with Sequence Dependent Setup Times. Lecture Notes in Computer Science, 788-793. doi:10.1007/11427391_126 es_ES
dc.description.references Wang, H. (2005). Flexible flow shop scheduling: optimum, heuristics and artificial intelligence solutions. Expert Systems, 22(2), 78-85. doi:10.1111/j.1468-0394.2005.00297.x es_ES
dc.description.references Wilson, A. D., King, R. E., & Hodgson, T. J. (2004). Scheduling non-similar groups on a flow line: multiple group setups. Robotics and Computer-Integrated Manufacturing, 20(6), 505-515. doi:10.1016/j.rcim.2004.07.002 es_ES
dc.description.references Wittrock, R. J. (1988). An Adaptable Scheduling Algorithm for Flexible Flow Lines. Operations Research, 36(3), 445-453. doi:10.1287/opre.36.3.445 es_ES
dc.description.references Zandieh, M., Fatemi Ghomi, S. M. T., & Moattar Husseini, S. M. (2006). An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times. Applied Mathematics and Computation, 180(1), 111-127. doi:10.1016/j.amc.2005.11.136 es_ES


Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem