- -

The distributed assembly permutation flowshop scheduling problem

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

Compartir/Enviar a

Citas

Estadísticas

  • Estadisticas de Uso

The distributed assembly permutation flowshop scheduling problem

Mostrar el registro sencillo del ítem

Ficheros en el ítem

Thumbnail
Nombre: DAPFSP.pdf
Tamaño: 576.1Kb
Formato: PDF
Descripción: Versión del Autor.
Abrir
[Cerrado]
Nombre: 13304349.pdf
Tamaño: 724.7Kb
Formato: PDF
Descripción: Versión editorial
Solicitar una copia al autor
dc.contributor.author Hatami, Sara es_ES
dc.contributor.author Ruiz García, Rubén es_ES
dc.contributor.author Andrés Romano, Carlos es_ES
dc.date.accessioned 2014-11-24T10:36:21Z
dc.date.available 2014-11-24T10:36:21Z
dc.date.issued 2013-09
dc.identifier.issn 0020-7543
dc.identifier.uri http://hdl.handle.net/10251/44606
dc.description.abstract Nowadays, improving the management of complex supply chains is a key to become competitive in the twenty-first century global market. Supply chains are composed of multi-plant facilities that must be coordinated and synchronised to cut waste and lead times. This paper proposes a Distributed Assembly Permutation Flowshop Scheduling Problem (DAPFSP) with two stages to model and study complex supply chains. This problem is a generalisation of the Distributed Permutation Flowshop Scheduling Problem (DPFSP). The first stage of the DAPFSP is composed of f identical production factories. Each one is a flowshop that produces jobs to be assembled into final products in a second assembly stage. The objective is to minimise the makespan. We present first a Mixed Integer Linear Programming model (MILP). Three constructive algorithms are proposed. Finally, a Variable Neighbourhood Descent (VND) algorithm has been designed and tested by a comprehensive ANOVA statistical analysis. The results show that the VND algorithm offers good performance to solve this scheduling problem. es_ES
dc.description.sponsorship Ruben Ruiz is partially supported by the Spanish Ministry of Science and Innovation, under the project 'RESULT - Realistic Extended Scheduling Using Light Techniques' with reference DPI2012-36243-C02-01. Carlos Andres-Romano is partially supported by the Spanish Ministry of Science and Innovation, under the project 'INSAMBLE' - Scheduling at assembly/disassembly synchronised supply chains with reference DPI2011-27633. en_EN
dc.language Inglés es_ES
dc.publisher Taylor & Francis: STM, Behavioural Science and Public Health Titles es_ES
dc.relation.ispartof International Journal of Production Research es_ES
dc.rights Reserva de todos los derechos es_ES
dc.subject Distributed assembly flowshop es_ES
dc.subject Variable neighborhood descent es_ES
dc.subject.classification ESTADISTICA E INVESTIGACION OPERATIVA es_ES
dc.subject.classification ORGANIZACION DE EMPRESAS es_ES
dc.title The distributed assembly permutation flowshop scheduling problem es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.1080/00207543.2013.807955
dc.relation.projectID info:eu-repo/grantAgreement/MINECO//DPI2012-36243-C02-01/ES/REALISTIC EXTENDED SCHEDULING USING LIGHT TECHNIQUES/ es_ES
dc.relation.projectID info:eu-repo/grantAgreement/MICINN//DPI2011-27633/ES/PROGRAMACION DE PRODUCCION EN CADENAS DE SUMINISTRO SINCRONIZADAS MULTIETAPA CON ENSAMBLAJES%2FDESENSAMBLAJES CON RENOVACION CONSTANTE DE PRODUCTOS EN UN CONTEXTO DE INNOVACION/ es_ES
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.contributor.affiliation Universitat Politècnica de València. Departamento de Organización de Empresas - Departament d'Organització d'Empreses es_ES
dc.contributor.affiliation Universitat Politècnica de València. Instituto Universitario Mixto Tecnológico de Informática - Institut Universitari Mixt Tecnològic d'Informàtica es_ES
dc.description.bibliographicCitation Hatami, S.; Ruiz García, R.; Andrés Romano, C. (2013). The distributed assembly permutation flowshop scheduling problem. International Journal of Production Research. 51(17):5292-5308. https://doi.org/10.1080/00207543.2013.807955 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion http://dx.doi.org/10.1080/00207543.2013.807955 es_ES
dc.description.upvformatpinicio 5292 es_ES
dc.description.upvformatpfin 5308 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 51 es_ES
dc.description.issue 17 es_ES
dc.relation.senia 255726
dc.contributor.funder Ministerio de Ciencia e Innovación es_ES
dc.contributor.funder Ministerio de Economía y Competitividad es_ES
dc.description.references Basso, D., Chiarandini, M., & Salmaso, L. (2007). Synchronized permutation tests in replicated designs. Journal of Statistical Planning and Inference, 137(8), 2564-2578. doi:10.1016/j.jspi.2006.04.016 es_ES
dc.description.references Biggs, D., De Ville, B., & Suen, E. (1991). A method of choosing multiway partitions for classification and decision trees. Journal of Applied Statistics, 18(1), 49-62. doi:10.1080/02664769100000005 es_ES
dc.description.references Chan, F. T. S., Chung, S. H., Chan, L. Y., Finke, G., & Tiwari, M. K. (2006). Solving distributed FMS scheduling problems subject to maintenance: Genetic algorithms approach. Robotics and Computer-Integrated Manufacturing, 22(5-6), 493-504. doi:10.1016/j.rcim.2005.11.005 es_ES
dc.description.references Chan, F. T. S., Chung, S. H., & Chan, P. L. Y. (2006). Application of genetic algorithms with dominant genes in a distributed scheduling problem in flexible manufacturing systems. International Journal of Production Research, 44(3), 523-543. doi:10.1080/00207540500319229 es_ES
dc.description.references Liao, C.-J., & Liao, L.-M. (2008). Improved MILP models for two-machine flowshop with batch processing machines. Mathematical and Computer Modelling, 48(7-8), 1254-1264. doi:10.1016/j.mcm.2008.01.001 es_ES
dc.description.references Framinan, J. M., & Leisten, R. (2003). An efficient constructive heuristic for flowtime minimisation in permutation flow shops. Omega, 31(4), 311-317. doi:10.1016/s0305-0483(03)00047-1 es_ES
dc.description.references Gao, J., & Chen, R. (2011). A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem. International Journal of Computational Intelligence Systems, 4(4), 497-508. doi:10.1080/18756891.2011.9727808 es_ES
dc.description.references Hansen, P., & Mladenović, N. (2001). Variable neighborhood search: Principles and applications. European Journal of Operational Research, 130(3), 449-467. doi:10.1016/s0377-2217(00)00100-4 es_ES
dc.description.references Hariri, A. M. A., & Potts, C. N. (1997). A branch and bound algorithm for the two-stage assembly scheduling problem. European Journal of Operational Research, 103(3), 547-556. doi:10.1016/s0377-2217(96)00312-8 es_ES
dc.description.references Jia, H. Z., Fuh, J. Y. H., Nee, A. Y. C., & Zhang, Y. F. (2002). Web-based Multi-functional Scheduling System for a Distributed Manufacturing Environment. Concurrent Engineering, 10(1), 27-39. doi:10.1177/1063293x02010001054 es_ES
dc.description.references Jia, H. Z., Nee, A. Y. C., Fuh, J. Y. H., & Zhang, Y. F. (2003). Journal of Intelligent Manufacturing, 14(3/4), 351-362. doi:10.1023/a:1024653810491 es_ES
dc.description.references Jia, H. Z., Fuh, J. Y. H., Nee, A. Y. C., & Zhang, Y. F. (2007). Integration of genetic algorithm and Gantt chart for job shop scheduling in distributed manufacturing systems. Computers & Industrial Engineering, 53(2), 313-320. doi:10.1016/j.cie.2007.06.024 es_ES
dc.description.references Kass, G. V. (1980). An Exploratory Technique for Investigating Large Quantities of Categorical Data. Applied Statistics, 29(2), 119. doi:10.2307/2986296 es_ES
dc.description.references Lee, C.-Y., Cheng, T. C. E., & Lin, B. M. T. (1993). Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem. Management Science, 39(5), 616-625. doi:10.1287/mnsc.39.5.616 es_ES
dc.description.references Morgan, J. N., & Sonquist, J. A. (1963). Problems in the Analysis of Survey Data, and a Proposal. Journal of the American Statistical Association, 58(302), 415-434. doi:10.1080/01621459.1963.10500855 es_ES
dc.description.references Pan, Q.-K., & Ruiz, R. (2012). Local search methods for the flowshop scheduling problem with flowtime minimization. European Journal of Operational Research, 222(1), 31-43. doi:10.1016/j.ejor.2012.04.034 es_ES
dc.description.references Potts, C. N., Sevast’janov, S. V., Strusevich, V. A., Van Wassenhove, L. N., & Zwaneveld, C. M. (1995). The Two-Stage Assembly Scheduling Problem: Complexity and Approximation. Operations Research, 43(2), 346-355. doi:10.1287/opre.43.2.346 es_ES
dc.description.references Ruiz, R., & Stützle, T. (2007). A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research, 177(3), 2033-2049. doi:10.1016/j.ejor.2005.12.009 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 Ruiz, R., & Andrés-Romano, C. (2011). Scheduling unrelated parallel machines with resource-assignable sequence-dependent setup times. The International Journal of Advanced Manufacturing Technology, 57(5-8), 777-794. doi:10.1007/s00170-011-3318-2 es_ES
dc.description.references Stafford, E. F., Tseng, F. T., & Gupta, J. N. D. (2005). Comparative evaluation of MILP flowshop models. Journal of the Operational Research Society, 56(1), 88-101. doi:10.1057/palgrave.jors.2601805 es_ES
dc.description.references Tozkapan, A., Kırca, Ö., & Chung, C.-S. (2003). A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem. Computers & Operations Research, 30(2), 309-320. doi:10.1016/s0305-0548(01)00098-3 es_ES
dc.description.references Tseng, F. T., & Stafford, E. F. (2008). New MILP models for the permutation flowshop problem. Journal of the Operational Research Society, 59(10), 1373-1386. doi:10.1057/palgrave.jors.2602455 es_ES


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

Mostrar el registro sencillo del ítem