Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 2
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Flowshop with additional resources during setups: Mathematical models and a GRASP algorithm

  • Yepes-Borrero, Juan C.
  • Perea, Federico
  • Villa Juliá, Mª Fulgencia|||0000-0003-0019-8777
  • Vallada Regalado, Eva|||0000-0003-3918-1788
[EN] Machine scheduling problems arise in many production processes, and are something that needs to be consider when optimizing the supply chain. Among them, flowshop scheduling problems happen when a number of jobs have to be sequentially processed by a number of machines. This paper addressees, for the first time, the Permutation Flowshop Scheduling problem with additional Resources during Setups (PFSR-S). In this problem, in addition to the standard permutation flowshop constraints, each machine requires a setup between the processing of two consecutive jobs. A number of additional and scarce resources, e.g. operators, are needed to carry out each setup. Two Mixed Integer Linear Programming formulations and an exact algorithm are proposed to solve the PFSR-S. Due to its complexity, these approaches can only solve instances of small size to optimality. Therefore, a GRASP metaheuristic is also proposed which provides solutions for much larger instances. All the methods designed for the PFSR-S in this paper are computationally tested over a benchmark of instances adapted from the literature. The results obtained show that the GRASP metaheuristic finds good quality solutions in short computational times., Juan C. Yepes-Borrero acknowledges financial support by Colfuturo under program Credito-Beca grant number 201503877 and from ElInstituto Colombiano de Credito Educativo y Estudios Tecnicos en el Exterior - ICETEX under program Pasaporte a la ciencia - Doctor-ado, Foco-reto pais 4.2.3, grant number 3568118. This research hasbeen partially supported by the Agencia Estatal de Investigacion (AEI)and the European Regional Development's fund (ERDF): PID2020-114594GB-C21; Regional Government of Andalusia: projects FEDER-US-1256951, AT 21_00032, and P18-FR-1422; Fundacion BBVA: project Netmeet Data (Ayudas Fundacion BBVA a equipos de investigacioncientifica 2019). The authors are partially supported by Agencia Valenciana de la Innovacion (AVI) under the project ireves (innovacionen vehiculos de emergencia sanitaria): una herramienta inteligente dedecision'' (No. INNACC/2021/26) partially financed with FEDER funds(interested readers can visit http://ireves.upv.es), and by the Spanish Ministry of Science and Innovation under the project OPRES-RealisticOptimization in Problems in Public Health'' (No. PID2021-124975OB-I00), partially financed with FEDER funds. Part of the authors aresupported by the Faculty of Business Administration and Managementat Universitat Politecnica de Valencia
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Bi-objective parallel machine scheduling with additional resources during setups

  • Yepes-Borrero, Juan C.
  • Perea, Federico
  • Ruiz García, Rubén
  • Villa Juliá, Mª Fulgencia|||0000-0003-0019-8777
[EN] We present a bi-objective parallel machine scheduling problem with machine and job sequence dependent setup times, with the additional consideration of resources needed during setups. The availability of such resources is limited. This models many practical situations where setup times imply, for example, cleaning and/or the reconfiguration of productive equipment. These setups are performed by personnel, who are of course limited in number. The objectives considered are the minimization of the makespan and the minimization of the number of resources. Fewer available resources reduce production costs but inevitably increase the makespan. On the contrary, a greater number of resources increase costs but allow for more setups to be done in parallel and a reduced makespan. An algorithm based on iterated greedy approaches is proposed to search for the Pareto front of the problem. This algorithm is compared with state-of-the art methods adapted to the problem. Computational experiments, supported by statistical analyses, indicate that the proposed approach outperforms all other tested procedures., The authors would like to acknowledge the support from "Ministerio de Ciencia, Innovacion y Universidades" under grant "Optimizacion de Operaciones en Terminales Portuarias (OPTEP)" (No. RTI2018-094940-B-100) and grant MTM2016-74983, from the "Universitat Politecnica de Valencia" under grant SP20180164 of the program "Primeros Proyectos de Investigacion (PAID-06-18), Vicerrectorado de Investigacion, Innovacion y Transferencia", and from the "Generalitat Valenciana" under grant "NUevos REtos en SEcuenciacion"(No. AICO/2020/049). Juan C. Yepes-Borrero acknowledges financial support by "El Instituto Colombiano de Credito Educativo y Estudios Tecnicos en el Exterior - ICETEX" under program "Pasaporte a la ciencia - Doctorado", grant number 3568118.