Browsing by Subject "Mathematical optimization"

Now showing items 1-20 of 190

    • A biased-randomized discrete-event algorithm for the hybrid flow shop problem with time dependencies and priority constraints 

      Laroque, Christoph; Leißau, Madlene; Copado Méndez, Pedro Jesús; Schumacher, Christin; Panadero Martínez, Javier; Juan Pérez, Ángel Alejandro (Multidisciplinary Digital Publishing Institute (MDPI), 2022-02-02)
      Article
      Open Access
      Based on a real-world application in the semiconductor industry, this article models and discusses a hybrid flow shop problem with time dependencies and priority constraints. The analyzed problem considers a production ...

    • A Bicriteria Simulated Annealing Algorithm for Scheduling Jobs on Parallel Machines with Sequence Dependent Setup Times 

      Persson, Rasmus (Universitat Politècnica de Catalunya, 2008-09)
      Master thesis (pre-Bologna period)
      Open Access
      The study considers the scheduling problem of identical parallel machines subject to minimization of the maximum completion time and the maximum tardiness expressed in a linear convex objective function. The maximum ...

    • A capacitated commodity trading model with market power 

      Vendrell Simón, Josep Mª (Universitat Politècnica de Catalunya, 2008-02)
      Master thesis
      Open Access
      This Master Thesis proposes an analytical model of commodity trading in the presence of market power, which is new to the literature. We establish the rational behavior of traders between two markets and derive price ...

    • A characterization of weighted simple games based on pseudoweightings 

      Freixas Bosch, Josep (2020-09-14)
      Article
      Open Access
      The paper provides a new characterization of weighted games within the class of simple games. It is based on a stronger form of the point-set-additive pseudoweighting property of simple games. The characterization obtained ...

    • 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)
      Conference report
      Open Access
      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 computational evaluation of constructive heuristics for the parallel blocking flow shop problem with sequence-dependent setup times 

      Ribas Vila, Immaculada; Companys Pascual, Ramón (2021-01-22)
      Article
      Open Access
      This paper deals with the problem of scheduling jobs in a parallel flow shop environment without buffers between machines and with sequence-dependent setup times in order to minimize the maximum completion time of jobs. ...

    • A consistent approximation of the total perimeter functional for topology optimization algorithms 

      Amstutz, Samuel; Dapogny, Charles; Ferrer Ferré, Àlex (2022-02-24)
      Article
      Open Access
      This article revolves around the total perimeter functional, one particular version of the perimeter of a shape O contained in a fixed computational domain D measuring the total area of its boundary ¿O, as opposed to its ...

    • 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 Dynamic Stochastic Model For Balance Sheet Optimization 

      Barnils Sanchez, Armand (Universitat Politècnica de Catalunya / Illinois Institute of Technology, 2013)
      Bachelor thesis
      Restricted access - author's decision
      Covenantee:   Illinois Institute of Technology

    • A fast CTA method without the complicating binary decisions 

      Castro Pérez, Jordi; González Alastrué, José Antonio (2013)
      Conference report
      Open Access

    • A Framework for RNAV trajectory generation minimizing noise nuisances 

      Prats Menéndez, Xavier; Nejjari Akhi-Elarab, Fatiha; Puig Cayuela, Vicenç; Quevedo Casín, Joseba Jokin; Mora Camino, F. (Faculty of Transport and Traffic Engineering, 2006-06)
      Conference report
      Open Access
      In this work it is presented a framework for a global optimization tool that will take into account air craft dynamics and performances, noise nuisances and RNAV radionavigation requirements in order to assess an optimum ...

    • A GRASP algorithm for quota sequences with minimum work overload and forced interruption of operations in a mixed-product assembly line 

      Bautista Valhondo, Joaquín; Alfaro Pozo, Rocío (Springer, 2018-03-13)
      Article
      Open Access
      We present a GRASP algorithm to solve a problem that involves the sequencing of mixed products in an assembly line. The objective of the problem is to obtain a manufacturing sequence of models that generates a minimum work ...

    • A meta-heuristic method to design off-grid community electrification projects with renewable energies 

      Ranaboldo, Matteo; García Villoria, Alberto; Ferrer Martí, Laia; Pastor Moreno, Rafael (2015)
      Article
      Open Access
      The design of off-grid electrification projects considering hybrid systems and distribution microgrids is a complex task that requires the use of decision support tools. Most of existing tools focus on the design of hybrid ...

    • A Method to design job rotation schedules to prevent work-related musculoskeletal disorders in repetitive work 

      Asensio-Cuesta, Sabina; Diego-Mas, J.A.; Cremades Oliver, Lázaro Vicente; González-Cruz, M.C. (Taylor & Francis, 2012-03-06)
      Article
      Restricted access - publisher's policy
      Job rotation is an organisational strategy widely used in human-based production lines with the aim of preventing work-related musculoskeletal disorders (WMSDs). These work environments are characterised by the presence ...

    • A new hybrid evolutionary algorithm for the treatment of equality constrained MOPs 

      Cuate, Oliver; Ponsich, Antonin Sebastien; Uribe, Lourdes; Zapotecas Martínez, Saúl; Lara, Adriana; Schütze, Oliver (Multidisciplinary Digital Publishing Institute (MDPI), 2019-12-18)
      Article
      Open Access
      Multi-objective evolutionary algorithms are widely used by researchers and practitioners to solve multi-objective optimization problems (MOPs), since they require minimal assumptions and are capable of computing a finite ...

    • A note on log space optimization 

      Álvarez Faura, M. del Carme; Jenner, Birgit (1992-12-30)
      Research report
      Open Access
      We show that computing iterated multiplication of word matrices over {0,1}, using the operations maximum and concatenation, is complete for the class optL of log space optimization functions. The same problem for word ...

    • A proposed mathematical model for the personnel scheduling problem in a manufacturing company 

      Tomàs Olivé, Josep (Universitat Politècnica de Catalunya / Istanbul Teknik Üniversitesi, 2009)
      Master thesis (pre-Bologna period)
      Restricted access - author's decision
      In the current economic and industrial conditions, with demand ever fluctuating and optimization more important in every field, designing a timetable to define a personnel schedule is not an easy task. Personnel scheduling ...

    • A randomized iterated greedy algorithm for the founder sequence reconstruction problem 

      Benedettini, Stefano; Blum, Christian; Roli, Andrea (2010-04)
      Article
      Restricted access - publisher's policy
      The problem of inferring ancestral genetic information in terms of a set of founders of a given population arises in various biological contexts. In optimization terms, this problem can be formulated as a combinatorial ...

    • A simheuristic algorithm for service placement in community networks 

      Panadero Martínez, Javier; Calvet Liñán, Laura; Bayliss, Christopher; Marques Puig, Joan Manuel; Selimi, Mennan; Freitag, Fèlix (Institute of Electrical and Electronics Engineers (IEEE), 2020)
      Conference report
      Open Access
      The growing demand for network connectivity has boosted the number of community networks (CNs). CNs are decentralized and self-organized communication networks owned and managed at the edge by volunteers. Due to the ...

    • A static benchmarking for grid scheduling problems 

      Xhafa Xhafa, Fatos; Barolli, Leonard; Gonzalez S, Juan Antonio; Jura, Pawel (Institute of Electrical and Electronics Engineers (IEEE), 2009)
      Conference report
      Open Access
      Analysis of algorithms for Grid computing systems before deployment in real Grid infrastructures is an important issue in Grid computing domain. Due to the complexity of real Grid systems, assessing performance analysis ...