Now showing items 1-20 of 89

    • A biased random-key genetic algorithm for the capacitated minimum spanning tree problem 

      Ruiz Ruiz, Hector Efrain; Albareda Sambola, Maria; Fernández Aréizaga, Elena; Resende, Mauricio G. C. (2015-05)
      Article
      Open Access
      This paper focuses on the capacitated minimum spanning tree(CMST)problem.Given a central processor and a set of remote terminals with specified demands for traffic that must flow between the central processor and terminals,the ...
    • A bounded dynamic programming algorithm for the blocking flow shop problem 

      Bautista Valhondo, Joaquín; Cano Pérez, Alberto; Companys Pascual, Ramón; Ribas Vila, Immaculada (IEEE Computer Society Conference Publishing Services (CPS), 2011-04-11)
      Part of book or chapter of book
      Restricted access - publisher's policy
      We present some results attained with two variants of the bounded dynamic programming algorithm to solve the Fm|block|Cmax problem using as experimental data the wellknown Taillard instances. We have improved the best-known ...
    • A branch and bound algorithm for the response time variability problem 

      García Villoria, Alberto; Corominas Subias, Albert; Delorme, Xavier; Alexandre, Dolgui; Wieslaw, Kubiak; Pastor Moreno, Rafael (Editorial Board, 2012-06-22)
      Article
      Restricted access - publisher's policy
      The response time variability problem (RTVP) is an NP-hard scheduling problem that has been studied intensively recently and has a wide range of real-world applications in mixed-model assembly lines, multithreaded computer ...
    • A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem 

      Blum, Christian; Blesa Aguilera, Maria Josep (2018-06)
      Article
      Open Access
      This paper deals with an NP-hard string problem from the bio-informatics field: the repetition-free longest common subsequence problem. This problem has enjoyed an increasing interest in recent years, which has resulted ...
    • A heuristic for the inventory management of smart vending machine systems 

      Park, Yang-Byung (School of Industrial and Aeronautic Engineering of Terrassa (ETSEIAT). Universitat Politècnica de Catalunya (UPC), 2012-12)
      Article
      Open Access
      Purpose: The purpose of this paper is to propose a heuristic for the inventory management of smart vending machine systems with product substitution under the replenishment point, order-up-to level policy and to evaluate ...
    • A hybrid algorithm combining heuristics with Monte Carlo simulation for solving the Stochastic Flow Shop Problem 

      Juan Pérez, Angel Alejandro; Peruyero, Esteban; Riera Terrén, Daniel (2011)
      Conference report
      Open Access
      In this paper a hybrid simulation-based algorithm is proposed for the Stochastic Flow Shop Problem. The main idea of the methodology is to transform the stochastic problem into a deterministic problem and then apply ...
    • A hybrid dynamic programming for solving a mixed-model sequencing problem with production mix restriction and free interruptions 

      Bautista Valhondo, Joaquín; Cano Pérez, Alberto; Alfaro Pozo, Rocío (Springer, 2017-03)
      Article
      Open Access
      In this article, we propose a hybrid procedure based on bounded dynamic programming assisted by linear programming to solve the mixed-model sequencing problem with workload minimization with serial workstations, free ...
    • A hybrid flow shop model for an ice cream production scheduling problem 

      Ribas Vila, Immaculada; Companys Pascual, Ramón (School of Industrial and Aeronautic Engineering of Terrassa (ETSEIAT). Universitat Politècnica de Catalunya (UPC), 2009-06)
      Article
      Open Access
      In this paper we address the scheduling problem that comes from an ice cream manufacturing company. This production system can be modelled as a three stage nowait hybrid flow shop with batch dependent setup costs. To ...
    • A multistage graph-based procedure for solving a just-in-time flexible job-shop scheduling problem with machine and time-dependent processing costs 

      Corominas Subias, Albert; García Villoria, Alberto; González Vargas, Néstor Andrés; Pastor Moreno, Rafael (2018-04-01)
      Article
      Open Access
      This paper deals with a new flexible job-shop scheduling problem in which the objective function to be minimised is the sum of the earliness and tardiness costs of the jobs and the costs of the operations required to perform ...
    • A New Constructive Heuristic for the Fm|block|ST 

      Companys Pascual, Ramón; Ribas Vila, Immaculada (2014-08-31)
      Part of book or chapter of book
      Open Access
      This paper deals with the blocking flow shop problem and proposes new constructive procedures for the total tardiness minimization of jobs. The heuristic has three-phases to build the sequence; the first phase selects the ...
    • A new constructive heuristic for the Fm|block|¿T 

      Companys Pascual, Ramón; Ribas Vila, Immaculada (2013)
      Conference report
      Open Access
      This paper deals with the blocking flow shop problem and proposes new constructive procedure s for the total tardiness minimization of jobs. The heuristic has three - phases to build the sequence; the first phase ...
    • A novel algorithm for isolated electrification projects 

      Ranaboldo, Matteo; García Villoria, Alberto; Ferrer Martí, Laia; Pastor Moreno, Rafael (2015-05-04)
      External research report
      Open Access
      In this report it is proposed a metaheuristic procedure to support the design of stand - alone commun ity electrification projects. In particular, the solution returned by the procedure ...
    • A Parameter-free approach for solving combinatorial optimization problems through biased randomization of efficient heuristics 

      Ionescu, Dragos; Juan Pérez, Angel Alejandro; Faulín, Javier; Ferrer Biosca, Alberto (2011-01)
      Article
      Open Access
      This paper discusses the use of probabilistic or randomized algorithms for solving combinatorial optimization problems. Our approach employs non-uniform probability distributions to add a biased random behavior to classical ...
    • A refined GRASP algorithm for the extended car sequencing problem 

      Lacovic, Elvira; Chica Serrano, Manuel; Damas Arroyo, Sergio; Bautista Valhondo, Joaquín; Cordón García, Oscar (2015)
      Conference report
      Open Access
      In this study, we investigate the performance of GRASP (Greedy Randomized Adaptive Search Procedure) mataheuristic that has been used for solving extended optimization version of CSP (Car Sequencing Problem) with respect ...
    • A variable neighborhood search algorithm for the constrained task allocation problem 

      Lusa García, Amaia; Potts, Chris N. (2006-01)
      External research report
      Open Access
      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
      Open Access
      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 scheduling on power-aware managed data-centers using machine learning 

      Berral García, Josep Lluís; Gavaldà Mestre, Ricard; Torres Viñals, Jordi (IEEE Computer Society Publications, 2011)
      Conference report
      Restricted access - publisher's policy
      Energy-related costs have become one of the major economic factors in IT data-centers, and companies and the research community are currently working on new efficient power-aware resource management strategies, also known ...
    • An efficient discrete artificial bee colony algorithm for the blocking flow shop problem with total flowtime minimization 

      Ribas Vila, Immaculada; Companys Pascual, Ramón; Tort-Martorell Llabrés, Xavier (2015-09-01)
      Article
      Open Access
      This paper presents a high performing Discrete Artificial Bee Colony algorithm for the blocking flow shop problem with flow time criterion. To develop the proposed algorithm, we considered four strategies for the food ...
    • An efficient hybrid iterated local search algorithm for the total tardiness blocking flow shop problem 

      Ribas Vila, Immaculada; Companys Pascual, Ramón; Tort-Martorell Llabrés, Xavier (2012-09-04)
      External research report
      Open Access
      This paper deals with the blocking flow shop problem and proposes an Iterated Local Search (ILS) procedure combined with a variable neighbourhood search (VNS) for the total tardiness minimization. The proposed ILS makes ...
    • An efficient iterated local search algorithm for the total tardiness blocking flow shop problem 

      Ribas Vila, Immaculada; Companys Pascual, Ramón; Tort-Martorell Llabrés, Xavier (Taylor & Francis, 2013-04-27)
      Article
      Restricted access - publisher's policy
      This paper deals with the blocking flow shop problem and proposes an Iterated Local Search (ILS) procedure combined with a variable neighbourhood search (VNS) for the total tardiness minimisation. The proposed ILS makes ...