Browsing by Subject "Makespan"
RiuNet: Institutional repository of the Polithecnic University of Valencia
- RiuNet UPV Home
- :
- Browsing by Subject
JavaScript is disabled for your browser. Some features of this site may not work without it.
Search RiuNet
Browse
My Account
RiuNet Help
Admin. UPV
Browsing by Subject "Makespan"
Now showing items 1-20 of 21
-
Salido, Miguel A.; Escamilla Fuster, Joan; Giret Boggino, Adriana Susana; Barber, Federico (Springer Verlag (Germany), 2016-07)Many real-world scheduling problems are solved to obtain optimal solutions in term of processing time, cost, and quality as optimization objectives. Currently, energyefficiency is also taken into consideration in these ... -
Vallada Regalado, Eva; Ruiz García, Rubén (Elsevier, 2011-06-16)In this work a genetic algorithm is presented for the unrelated parallel machine scheduling problem in which machine and job sequence dependent setup times are considered. The proposed genetic algorithm includes a fast ... -
Asensio Cuesta, Sabina; Gómez-Gasquet, Pedro (Publicaciones DYNA, 2017)[EN] The manufacturer industry is characterized by the presence of highly repetitive movements, which is a major risk factor associated with work musculoskeletal disorders (WMSDs). Moreover, this risk factor worsens when ... -
Gómez-Gasquet, Pedro; Segura Andrés, Rubén; Andrés Romano, Carlos (OmniaScience, 2013)[EN] Purpose: This paper reviews current literature and contributes a set of findings that capture the current state-of-the-art of the topic of lot streaming in a flow-shop. Design/methodology/approach: A literature ... -
Gómez Gasquet, Pedro; Andrés Romano, Carlos; Lario Esteban, Francisco Cruz (Elsevier, 2012-07)This paper deals with a variant of flowshop scheduling, namely, the hybrid or flexible flowshop with sequence dependent setup times. This type of flowshop is frequently used in the batch production industry and helps reduce ... -
Pan, Quan-Ke; Ruiz García, Rubén (Elsevier, 2012-04)Lot-streaming flow shops have important applications in different industries including textile, plastic, chemical, semiconductor and many others. This paper considers an n-job m-machine lot-streaming flow shop scheduling ... -
Khan, Wasif Ullah; Ali, Mohammed (Universitat Politècnica de València, 2019-07-31)[EN] This work presented in this paper is based on the simulation of the routing flexibility enabled manufacturing system. In this study four levels of each factor (i.e. routing flexibility, system load conditions, system ... -
Dai, Min; Tang, Dunbing; Giret Boggino, Adriana Susana; Salido Gregorio, Miguel Angel; Li, W.D. (Elsevier, 2013-11)[EN] The traditional production scheduling problem considers performance indicators such as processing time, cost and quality as optimization objectives in manufacturing systems; however, it does not take energy consumption ... -
Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem Vallada Regalado, Eva; Villa Juliá, Mª Fulgencia; Fanjul-Peyro, Luis (Elsevier, 2019-11)[EN] A Scatter Search algorithm together with an enriched Scatter Search and an enriched Iterated Greedy for the unrelated parallel machine problem with one additional resource are proposed in this paper. The optimisation ...
-
Villa Juliá, Mª Fulgencia; Vallada Regalado, Eva; Fanjul Peyró, Luis (Elsevier, 2018)[EN] In this paper, we study the unrelated parallel machine scheduling problem with one scarce additional resource to minimise the maximum completion time of the jobs or makespan. Several heuristics are proposed following ... -
Xiaoping Li; Tianze Jiang; Ruiz García, Rubén (Elsevier, 2016-01-01)Task scheduling has a significant impact on the performance of the MapReduce computing framework. In this paper, a scheduling problem of periodical batch jobs with makespan minimization is considered. The problem is ... -
Zhang, Ling (Universitat Politècnica de València, 2018-12-12)El problema presentado es bien conocido en la literatura, y está clasificado como NP-duro. Por ello, se hacen necesarios algoritmos eficientes para su resolución. En este trabajo se proponen diferentes algoritmos matheurísticos, ... -
López Esteve, Axel Javier (Universitat Politècnica de València, 2020-09-16)[ES] En este trabajo se pretende resolver el problema de secuenciación de máquinas paralelas no relacionadas con ajustes entre trabajos y recursos limitados adicionales. El objetivo del problema es minimizar el tiempo ... -
Perea Rojas Marcos, Federico; Fanjul Peyró, Luis; Ruiz García, Rubén (Elsevier, 2017)[EN] In this paper we analyze a parallel machine scheduling problem in which the processing of jobs on the machines requires a number of units of a scarce resource. This number depends both on the job and on the machine. ... -
Vallada Regalado, Eva; Ruiz García, Rubén; Framinan, Jose M. (Elsevier, 2015-02-01)[EN] In this work a new benchmark of hard instances for the permutation flowshop scheduling problem with the objective of minimising the makespan is proposed. The new benchmark consists of 240 large instances and 240 small ... -
Fanjul Peyró, Luis (Universitat Politècnica de València, 2011-02-01)Para iniciar esta Tesis Doctoral se buscó un problema de producción sencillo pero de amplia aplicación práctica que permitiera adaptarlo para llegar a problemas más generales y de más amplia aplicación. Por este motivo, ... -
Leuyckx, Keyne Luc (Universitat Politècnica de València, 2013-09-26)The main goal of this project is to work on CPU scheduling algorithms to improve the performance of jobs consisting of parallel communicating tasks and analyse the results with simulation. It is known that the use of Virtual ...
-
Andrés Romano, Carlos (Universitat Politècnica de València, 2014-07-08)Se muestra cómo se puede usar un grafo para representar una solución en un problema de secuenciación en mñaquinas y el uso de la técnica de camino crítico para calcular la fecha de fin del último trabajo (makespan) -
Minella, Gerardo Gabriel; Ruiz García, Rubén; Ciavotta, Michele (Elsevier, 2011-11)Multi-objective optimisation problems have seen a large impulse in the last decades. Many new techniques for solving distinct variants of multi-objective problems have been proposed. Production scheduling, as with other ... -
Fanjul Peyró, Luis; Ruiz García, Rubén (Elsevier, 2012-07)[EN] In this paper we study two generalizations of the well known unrelated parallel machines scheduling problem under makespan (Cmax) minimization. First, a situation in which not every available parallel machine should ...
Now showing items 1-20 of 21
Content on this site is licensed under a Creative Commons Attribution-Non Commercial-No Derivs (by-nc-nd) License, except where otherwise noted.
Universitat Politècnica de València. Unit of cientific documentation (+34) 96 387 70 85 · RiuNet@bib.upv.es