Skip to main content

Resultados relacionados

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

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

Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem

  • Vallada Regalado, Eva|||0000-0003-3918-1788
  • Villa Juliá, Mª Fulgencia|||0000-0003-0019-8777
  • Fanjul-Peyro, Luis
[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 objective is to minimise the maximum completion of the jobs on the machines, that is, the makespan. All the proposed methods start from the best known heuristic for the same problem. Non feasible solutions are allowed in all the methods and a Repairing Mechanism is applied to obtain a feasible solution from a resource constraint point of view. All the proposed algorithms apply different local search procedures based on insertion, swap and restricted neighbourhoods. Computational experiments are carried out using an exhaustive benchmark of instances. After analysing the results, we can conclude that the enriched methods obtain superior results, outperforming the best known solutions for the same problem., The authors are supported by the Spanish Ministry of Economy and Competitiveness, under the projects "SCHEYARD - Optimization of Scheduling Problems in Container Yards" (No. DPI201565895-R) and "OPTEMAC -Optimizacion de Procesos en Terminales Maritimas de Contenedores" (No. DPI2014-53665-P), all of them partially financed with FEDER funds. The authors are also partially supported by the EU Horizon 2020 research and innovation programme under grant agreement no. 731932 "Transforming Transport: Big Data Value in Mobility and Logistics". Interested readers can download contents from http://soa.iti.es, like the instances used and a software for generating further instances. Source codes are available upon justified request from the authors.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Wideband Broadcasting: A Power-Efficient Approach to 5G Broadcasting

  • Gimenez Gandia, Jordi Joan
  • Mogarde, Javier
  • Stare, Erik
  • Gomez-Barquero, David|||0000-0003-2610-7765
[EN] Efficient and flexible use of spectrum will be inherent characteristics of fifth-generation (5G) communication technologies with native support of wideband operation with frequency reuse 1, i.e. all transmit sites use all available frequency resources. Although not from the very first 5G release of 3GPP (Third Generation Partnership Project), it is expected that broadcast/multicast technology components will later be added and fully integrated in the 5G system. The combination of both wideband and frequency reuse 1 may provide significant gains for broadcast transmissions in terms of energy efficiency, since it is more efficient to increase capacity by extending the bandwidth rather than increasing the transmit power over a given bandwidth. This breaks with the traditional concept of terrestrial broadcast frequency planning, and paves the way to new potential uses of UHF (Ultra High Frequency) spectrum bands for 5G broadcasting. This paper provides an insight into the fundamental advantages in terms of capacity, coverage as well as power saving of wideband broadcast operation. The role of the network deployment, linked to frequency reuse in the UHF band, and its influence in the performance of a Wideband Broadcasting system are discussed. The technical requirements and features that would enable such power-efficient solution are also addressed., This work was supported in part by the European Commission under the 5G-PPP project 5G-Xcast (H2020-ICT-2016-2 call, grant number 761498). The views expressed in this contribution are those of the authors and do not necessarily represent the project. This work was also partially supported by the Ministerio de Educacion y Ciencia, Spain (TEC2014-56483-R), co-funded by European FEDER funds.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Heuristic algorithms for the unrelated parallel machine scheduling problem with one scarce additional resource

  • Villa Juliá, Mª Fulgencia|||0000-0003-0019-8777
  • Vallada Regalado, Eva|||0000-0003-3918-1788
  • Fanjul Peyró, Luis
[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 two strategies: the first one is based on the consideration of the resource constraint during the whole solution construction process. The second one starts from several assignment rules without considering the resource constraint, and repairs the non feasible assignments in order to obtain a feasible solution. Several computation experiments are carried out over an extensive benchmark. A comparative evaluation against previously proposed mathematical models and matheuristics (combination of mathematical models and heuristics) is carried out. From the results, we can conclude that our methods outperform the existing ones, and the second strategy performs better, especially for large instances. (C) 2017 Elsevier Ltd. All rights reserved., The authors are supported by the Spanish Ministry of Economy and Competitiveness, under the projects "SCHEYARD - Optimization of Scheduling Problems in Container Yards" (No. DPI2015-65895-R) and "OPTEMAC - Optimizacion de Procesos en Terminales Maritimas de Contenedores" (No. DPI2014-53665-P), all of them partially financed with FEDER funds. The authors are also partially supported by the EU Horizon 2020 research and innovation programme under grant agreement no. 731932 "Transforming Transport: Big Data Value in Mobility and Logistics". Interested readers can download contents from http://soa.iti.es, like the instances used and a software for generating further instances. Source codes are available upon justified request from the authors.