• A comparison study on meta-heuristics for ground station scheduling problem 

      Xhafa Xhafa, Fatos; Herrero, Xavier; Barolli, Admir; Takizawa, Makoto (Institute of Electrical and Electronics Engineers (IEEE), 2014)
      Text en actes de congrés
      Accés obert
      In ground station scheduling problem the aim is to compute an optimal planning of communications between Spacecrafts (SCs) and operations teams of Ground Stations (GSs). While such allocation of tasks to ground stations ...
    • A variable neighborhood search algorithm for the constrained task allocation problem 

      Lusa García, Amaia; Potts, Chris N. (2006-01)
      Report de recerca
      Accés obert
      A Variable Neighborhood Search algorithm is proposed for solving a task allocation problem whose main characteristics are: (i) each task requires a certain amount of resources and each processor has a finite capacity to ...
    • A variable neighbourhood search algorithm for the constrained task allocation problem 

      Lusa García, Amaia; Potts, Chris N. (Nature Publishing Group, 2008-03)
      Article
      Accés obert
      A Variable Neighborhood Search algorithm that employs new neighbourhoods is proposed for solving a task allocation problem whose main characteristics are: (i) each task requires a certain amount of resources and each ...
    • Adaptive search heuristics for the generalized assignment problem 

      Ramalhinho Lourenço, Helena; Serra, Daniel (Universitat Politècnica de Catalunya. Secció de Matemàtiques i Informàtica, 2002)
      Article
      Accés obert
      The Generalized Assignment Problem consists of assigning a set of tasks to a set of agents at minimum cost. Each agent has a limited amount of a single resource and each task must be assigned to one and only one agent, ...
    • An optimization-based decomposition heuristic for the microaggregation problem 

      Castro Pérez, Jordi; Gentile, Claudio; Spagnolo Arrizabalaga, Enrique (Springer, 2022)
      Text en actes de congrés
      Accés obert
      Given a set of points, the microaggregation problem aims to find a clustering with a minimum sum of squared errors (SSE), where the cardinality of each cluster is greater than or equal to k. Points in the cluster are ...
    • Constraint Programming based Local Search for the Vehicle Routing Problem with Time Windows 

      Sala Reixach, Joan (Universitat Politècnica de Catalunya / Karlsruher Institut für Technology, 2012-09-30)
      Projecte/Treball Final de Carrera
      Accés obert
      El projecte es centra en el "Vehicle Routing Problem with Time Windows". Explora i testeja un mètode basat en una formulació del problema en termes de programació de restriccions. Implementa un mètode de cerca local amb ...
    • Exact and heuristic procedures for the Heijunka-flow shop scheduling problem with minimum makespan and job replicas 

      Bautista Valhondo, Joaquín (Springer, 2021-07-03)
      Article
      Accés obert
      In this paper, a new problem of job sequences in a workshop is presented, taking into account non-unit demands for the jobs and whose objective is to minimize the total completion time for all the jobs (Cmax) satisfying a ...
    • Minimising maximum response time 

      García Villoria, Alberto; Pastor Moreno, Rafael (2013-10)
      Article
      Accés restringit per política de l'editorial
      The minmax response time problem (mRTP) is a scheduling problem that has recently appeared in the literature and can be considered as a fair sequencing problem. This kind of problems appears in a wide range of real-world ...
    • Solving the permutation Heijunka flow shop scheduling problem with non-unit demands for jobs 

      Bautista Valhondo, Joaquín (Springer, 2021-09-13)
      Capítol de llibre
      Accés restringit per política de l'editorial
      In this paper a problem of job sequences in a workshop is presented, taking into account non-unit demands for these and whose objective is to obtain manufacturing sequences satisfying the Quota property with a minimum total ...