Now showing items 1-13 of 13

  • A deterministic algorithm for generating optimal three- stage layouts of homogenous strip pieces 

    Ji, Jun; Xing, Fei-Fei; Du, Jun; Shi, Ning; Cui, Yao-Dong (OmniaScience, 2014-12)
    Article
    Open Access
    Purpose: The time required by the algorithms for general layouts to solve the large-scale two-dimensional cutting problems may become unaffordable. So this paper presents an exact algorithm to solve above problems. De ...
  • 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 Berlin Heidelberg, 2016-08-30)
    Article
    Restricted access - publisher's policy
    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 ...
  • An inside analysis of a genetic-programming based optimizer 

    Muntés Mulero, Víctor; Aguilar Saborit, Josep; Larriba Pey, Josep; Zuzarte, Calisto; Markl, Volker (Institute of Electrical and Electronics Engineers, 2006)
    Conference report
    Open Access
    The use of evolutionary algorithms has been proposed as a powerful random search strategy to solve the join order problem. Specifically, genetic programming used in query optimization has been proposed as an alternative ...
  • Una aplicación de la programación dinámica acotada para un problema de taller mecánico con flujo regular y bloqueo de operaciones (Fm/block/Cmax) 

    Cano Pérez, Alberto (Universitat Politècnica de Catalunya, 2011-04-28)
    Master thesis (pre-Bologna period)
    Open Access
    El problema objeto de estudio es la programación de piezas en un sistema Flow Shop permutado con bloqueos. Este problema se ubica en el ámbito de los problemas asociados a Taller Mecánico. El objetivo de este proyecto es ...
  • Automatic learning of 3D pose variability in walking performances for gait analysis 

    Rius, Ignasi; González Sabaté, Jordi; Mozerov, Mikhail; Roca, Francesc Xavier (2008)
    Article
    Open Access
    This paper proposes an action specific model which automatically learns the variability of 3D human postures observed in a set of training sequences. First, a Dynamic Programing synchronization algorithm is presented in ...
  • Combining ant colony optimization with dynamic programming for solving the k-cardinality tree problem 

    Blum, Christian; Blesa Aguilera, Maria Josep (2005-04)
    External research report
    Open Access
    Research efforts in metaheuristics have shown that an intelligent incorporation of more classical optimization techniques in metaheuristics can be very beneficial. In this paper, we combine the metaheuristic ant colony ...
  • Extending OmpSs to support dynamic programming 

    Maroñas Bravo, Marcos (Universitat Politècnica de Catalunya, 2015-01-28)
    Bachelor thesis
    Open Access
    [CASTELLÀ] Tras un breve resumen sobre programación dinámica y OmpSs, este documento muestra como OmpSs ofrece soporte para memoización y los resultados obtenidos. Se detallan las extensiones del modelo, del compilador ...
  • From Earned Schedule Management to Dynamic Scheduling 

    Vilella Rojo, Julia (Universitat Politècnica de Catalunya / Université de Technologie de Belfort-Montbeliard, 2013)
    Bachelor thesis
    Open Access
    As an engineer, the scope of competences is not just being able to plan a good project, but to make sure that it’s well-performed, on time and on budget. In the past, traditional management was used for controlling and ...
  • Hybrid procedure based on Bounded Dynamic Programming and Linear Programming for solving a variant of the MMSP-W 

    Bautista Valhondo, Joaquín; Cano Pérez, Alberto; Alfaro Pozo, Rocío; Batalla García, Cristina (International Federation of Automatic Control (IFAC), 2013-06-21)
    Article
    Open Access
    In this paper, we propose a hybrid procedure based on Bounded Dynamic Programming (BDP) and linear programming to solve the Mixed-Model Sequencing Problem with Workload Minimization (MMSP-W), with serial workstations, free ...
  • Hybrid procedure based on Bounded Dynamic Programming and Linear Programming for solving a variant of the MMSP-W 

    Bautista Valhondo, Joaquín; Cano Pérez, Alberto; Alfaro Pozo, Rocío; Batalla García, Cristina (2013)
    Conference lecture
    Open Access
    n this paper, we propose a hybrid procedure based on Bounded Dynamic Programming ( BDP ) and linear programming to solve the Mixed - Model Se quencing Problem with Workload Minimization ( MMSP - W ), with serial ...
  • Programación dinàmica : métodos cuantitativos para la toma de decisiones II 

    Fonollosa Guardiet, Juan Bautista; Sallán Leyes, José María; Fernández Alarcón, Vicenç; Suñé Torrents, Albert (Universitat Politècnica de Catalunya. Iniciativa Digital Politècnica, 2016)
    Book
    Restricted access to the UPC academic community
    Esta obra forma parte de la colección Métodos Cuantitativos para la Toma de Decisiones, que, en su conjunto, permite resolver una amplia variedad de problemas. Cada volumen de esta colección desarrolla la técnica específica ...
  • Resolución del problema Minimum Rooted Arborescence mediante Ant Colony Optimization 

    Mateo Bellido, Sergi (Universitat Politècnica de Catalunya, 2012-01-25)
    Master thesis (pre-Bologna period)
    Open Access
    En este projecto se aborda el problema de hallar la arborescencia de peso mínimo enraizada en un cierto vértice. Se presenta un algoritmo Híbrido (entre otros) de Ant Colony Optimization y Programación Dinámica que genera ...
  • Solving a Mixed-Model Sequencing Problem with production mix restriction by Bounded Dynamic Programming 

    Bautista Valhondo, Joaquín; Alfaro Pozo, Rocío; Batalla García, Cristina; Cano Pérez, Alberto (2015-11-24)
    External research report
    Open Access
    In this article, we propose a hybrid procedure based on bounded dynamic programming (BDP) assisted by linear programming to solve the mixed-model sequencing problem with workload minimization (MMSP-W) with serial workstations, ...