Log in

Relevant bibliographies by topics / Generalized assignments problem / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Generalized assignments problem.

Dissertations / Theses on the topic 'Generalized assignments problem'

Author: Grafiati

Published: 28 May 2022

Last updated: 30 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 19 dissertations / theses for your research on the topic 'Generalized assignments problem.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Болмат, О. В. "Моделювання узагальненої задачі про призначення з підбором ефективного алгоритму". Master's thesis, Сумський державний університет, 2020. https://essuir.sumdu.edu.ua/handle/123456789/81392.

Full text

Abstract:

В роботі побудовано моделі для задачі про оптимальне призначення виконавцям (бібліотекам) робіт (сканування книг) за наявності обмежень на ресурси виконавців (час реєстрації для виконання робіт, обмежена кількість робіт на день) та обмеженні загального часу. Задача розв’язується з залученням евристичних алгоритмів, що застосовні для задач великого розміру. Побудовані алгоритми, що ґрунтуються на принципі оптимальності з динамічного програмування, та ітераційних послідовностях перестановок робіт з сортуванням. Наводяться результати програмної реалізації.<br>В роботі побудовано моделі для задачі

APA, Harvard, Vancouver, ISO, and other styles

2

Brommesson, Peter. "Solving the Generalized Assignment Problem by column enumeration based on Lagrangian reduced costs." Thesis, Linköping University, Department of Mathematics, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-5583.

Full text

Abstract:

<p>In this thesis a method for solving the Generalized Assignment Problem (GAP) is described. It is based on a reformulation of the original problem into a Set Partitioning Problem (SPP), in which the columns represent partial solutions to the original problem. For solving this problem, column generation, with systematic overgeneration of columns, is used. Conditions that guarantee that an optimal solution to a restricted SPP is optimal also in the original problem are given. In order to satisfy these conditions, not only columns with the most negative Lagrangian reduced costs need to be gener

APA, Harvard, Vancouver, ISO, and other styles

3

Karabulut, Ozlem. "Multi Resource Agent Bottleneck Generalized Assignment Problem." Master's thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/3/12611790/index.pdf.

Full text

Abstract:

In this thesis, we consider the Multi Resource Agent Bottleneck Generalized Assignment Problem. We aim to minimize the maximum load over all agents. We study the Linear Programming (LP) relaxation of the problem. We use the optimal LP relaxation solutions in our Branch and Bound algorithm while defining lower and upper bounds and branching schemes. We find that our Branch and Bound algorithm returns optimal solutions to the problems with up to 60 jobs when the number of agents is 5, and up to 30 jobs when the number of agents is 10, in less than 20 minutes. To find approximate solutions, we

APA, Harvard, Vancouver, ISO, and other styles

4

Jaramillo, Juan R. "The generalized machine layout problem." Morgantown, W. Va. : [West Virginia University Libraries], 2007. https://eidr.wvu.edu/etd/documentdata.eTD?documentid=5504.

Full text

Abstract:

Thesis (Ph. D.)--West Virginia University, 2007.<br>Title from document title page. Document formatted into pages; contains xi, 86 p. : ill. Includes abstract. Includes bibliographical references (p. 82-86).

APA, Harvard, Vancouver, ISO, and other styles

5

Tsakonas, Efthymios. "Convex Optimization for Assignment and Generalized Linear Regression Problems." Doctoral thesis, KTH, Signalbehandling, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-150338.

Full text

Abstract:

This thesis considers optimization techniques with applications in assignment and generalized linear regression problems. The first part of the thesis investigates the worst-case robust counterparts of combinatorial optimization problems with least squares (LS) cost functions, where the uncertainty lies on the linear transformation of the design variables. We consider the case of ellipsoidal uncertainty, and prove that the worst case robust LS optimization problem, although NP-hard, is still amenable to convexrelaxation based on semidefinite optimization. We motivate our proposed relaxation us

APA, Harvard, Vancouver, ISO, and other styles

6

Monori, Akos. "Task assignment optimization in SAP Extended WarehouseManagement." Thesis, Högskolan Dalarna, Datateknik, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:du-3598.

Full text

Abstract:

Nowadays in the world of mass consumption there is big demand for distributioncenters of bigger size. Managing such a center is a very complex and difficult taskregarding to the different processes and factors in a usual warehouse when we want tominimize the labor costs. Most of the workers’ working time is spent with travelingbetween source and destination points which cause deadheading. Even if a worker knowsthe structure of a warehouse well and because of that he or she can find the shortest pathbetween two points, it is still not guaranteed that there won’t be long traveling timebetween th

APA, Harvard, Vancouver, ISO, and other styles

7

PIGATTI, ALEXANDRE ALTOE. "MODELS AND ALGORITHMS FOR THE GENERALIZED ASSIGNMENT PROBLEM (PAG) AND APPLICATIONS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2003. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=4132@1.

Full text

Abstract:

COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>Esta dissertação estuda modelos e algoritmos para o Problema de Alocação Generalizada (PAG) . A motivação para este estudo foi uma nova aplicação do PAG: o Problema de Carregamento de Caminhões (PCC) . A pesquisa desenvolvida concentra-se no estudo e na proposta de algoritmos aproximados (metaeurísticas) e exatos para a resolução do PAG. Os algoritmos aproximados propostos baseiam-se em um conceito recentemente criado por Fischetti e Lodi (2003), que utiliza programação matemática inteira para a exploração eficiente de viz

APA, Harvard, Vancouver, ISO, and other styles

8

Woodcock, Andrew John. "Solving the generalized assignment problem : a hybrid Tabu search/branch and bound algorithm." Thesis, Loughborough University, 2007. https://dspace.lboro.ac.uk/2134/17881.

Full text

Abstract:

The research reported in this thesis considers the classical combinatorial optimization problem known as the Generalized Assignment Problem (GAP). Since the mid 1970's researchers have been developing solution approaches for this particular type of problem due to its importance both in practical and theoretical terms. Early attempts at solving GAP tended to use exact integer programming techniques such as Branch and Bound. Although these tended to be reasonably successful on small problem instances they struggle to cope with the increase in computational effort required to solve larger instanc

APA, Harvard, Vancouver, ISO, and other styles

9

ROCHA, DANIEL AMARAL DE MEDEIROS. "COMBINING METAHEURISTICS WITH MP SOLVERS, WITH APPLICATIONS TO THE GENERALIZED ASSIGNMENT PROBLEM (GAP)." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2009. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=15363@1.

Full text

Abstract:

COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>Métodos que combinam estratégias normalmente encontradas em algoritmos metaeurísticos com técnicas para resolver problemas de programação inteira mista (MIP) têm apresentado ótimos resultados nos últimos anos. Este trabalho propõe dois novos algoritmos nessa linha: um algoritmo que faz pós-processamento nas soluções encontradas pelo resolvedor MIP. Os dois algoritmos utilizam um novo tipo de vizinhança, chamada de vizinhança elipsoidal, que possui fortes semelhanças com as técnicas de relinking de algoritmos PR e que neste trabalh

APA, Harvard, Vancouver, ISO, and other styles

10

Kim, Seon Ki. "Branch-and-Price Method for Stochastic Generalized Assignment Problem, Hospital Staff Scheduling Problem and Stochastic Short-Term Personnel Planning Problem." Diss., Virginia Tech, 2009. http://hdl.handle.net/10919/37487.

Full text

Abstract:

The work presented in this dissertation has been focused on exploiting the branch-and-price (BNP) method for the solution of various stochastic mixed integer programming problems (MIPs). In particular, we address the stochastic generalized assignment problem (SGAP), a hospital staff scheduling problem (HSSP), a stochastic hospital staff scheduling problem (SHSSP), and a stochastic short-term personnel planning problem (SSTPP). The BNP method has been developed in concert with the dual stabilization technique and other enhancements of this method for each of these problems. In view of an excess

APA, Harvard, Vancouver, ISO, and other styles

11

Bou, saleh Mira. "Generalized Resource Assignment and Planning Optimization in Specialized Education and Home Care Services." Electronic Thesis or Diss., Bourgogne Franche-Comté, 2023. http://www.theses.fr/2023UBFCA023.

Full text

Abstract:

Cette thèse explore l'optimisation des services d'éducation spécialisée et de soins à domicile en France. Elle aborde les défis pratiques rencontrés dans ces domaines, en se concentrant principalement sur l'affectation et la planification des professionnels pour répondre aux divers besoins des personnes souffrant, par exemple, de déficiences visuelles ou auditives. La recherche s'articule autour de trois configurations : les problèmes d'affectation et de planification dans les services d'éducation spécialisée, l'intégration des services d'éducation spécialisée et de soins à domicile avec les d

APA, Harvard, Vancouver, ISO, and other styles

12

Fabbri, Cristiano. "Analisi ed ottimizzazione dei percorsi diagnostici presso l’AUSL di Bologna." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2017.

Find full text

Abstract:

Negli ultimi anni la popolazione residente nella regione Emilia-Romagna sta andando incontro ad un progressivo invecchiamento, con un conseguente aumento della domanda di servizi sempre più efficaci. Al tempo stesso, però, a causa della crisi, è stato necessario porre particolare attenzione all’utilizzo efficiente delle risorse. Uno dei tentativi di bilanciare entrambi questi obiettivi è Gastropack, ovvero un nuovo paradigma di presa in carico congiunta, fra curante e specialista, del paziente con bisogno di cura gastroenterologico, creato all’interno dell’AUSL di Bologna dal Dott. Vincenzo Ce

APA, Harvard, Vancouver, ISO, and other styles

13

Lundquist, Josefin, and Linnéa O'Hara. "An optimization model using the Assignment Problem to manage the location of parts : Master Thesis at the engine assembly at Scania CV AB." Thesis, Umeå universitet, Institutionen för matematik och matematisk statistik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-137825.

Full text

Abstract:

A key challenge for manufacturing companies is to store parts in an efficient way atthe lowest cost possible. As the demand of differentiated products increases, togetherwith the fact that old products are not phased out at the same pace, the need of usingstorage space as dynamically as possible becomes vital.Scania’s engine assembly manufactures engines for various automotive vehicles andmarine & industry applications. The variation in engine range in Scania’s offeringleads to the need of holding a vast, and increasing, assortment of parts in the produc-tion. As a consequence, this puts m

APA, Harvard, Vancouver, ISO, and other styles

14

Moussavi, Seyed Esmaeil. "Workforce scheduling and job rotation by considering ergonomic factors (Presentation of the Sequencing Generalized Assignment Problem) : application to production and home healthcare systems." Thesis, Bourgogne Franche-Comté, 2018. http://www.theses.fr/2018UBFCA017/document.

Full text

Abstract:

Cette thèse porte sur la planification du personnel en accordant une attention particulière à l'aspect humain et aux facteurs ergonomiques dans le domaine de la production. Un certain nombre de modèles mathématiques sont présentés pour formuler les problèmes d'ordonnancement et de planification du personnel étudié. Concernant les modèles de planification, la productivité du système de fabrication et le bien-être des travailleurs sont ciblés. De cette manière, une méthode d'affectation des travailleurs est présentée pour réduire le temps de production et une méthode d'ordonnancement pour la rot

APA, Harvard, Vancouver, ISO, and other styles

15

Lin, Chang-Pin, and 林長平. "Multi-resource Generalized Assignment Problem－Fleet Scheduling Problem." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/96395030427874953042.

Full text

Abstract:

碩士<br>國立高雄第一科技大學<br>運籌管理所<br>95<br>The manufacturing industry has to utilize resources in order to lower costs while meeting market demand, and then improve the competitive advantage. Under the environment of production of many product categories, the paper considers that the management must to consider the consumptive condition of equipment available hours、material demand and auxiliary resources. So the distribution of producible resources and whole benefit has closely relationship. The management hopes to balance the main resources during the long-term application, and reduces the mechanics

APA, Harvard, Vancouver, ISO, and other styles

16

Lai, Uei-Tseng, and 賴煒曾. "Two Algorithms for the Generalized Assignment Problem." Thesis, 1998. http://ndltd.ncl.edu.tw/handle/00351841419015932472.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

pai, jia-yan, and 白佳艷. "Hybrid Genetic Heuristic Algorithm for The Generalized Assignment Problem." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/95455584160207097106.

Full text

Abstract:

碩士<br>明志科技大學<br>工業管理研究所<br>97<br>The Generalized Assignment Problem (GAP) combines limited resource capacity and multi-dimensional knapsack problems to construct a combinatorial optimization problem; and it has extensive application in the areas of resource scheduling, factory selection, vehicle routing problem, etc. Capacity utilization has been used as an important indicator for effective allocation of limited resources to ensure that the total cost of all possible combinations can be minimized. The GAP assumes that each job is assign to one and only one agent (machine), but each agent may s

APA, Harvard, Vancouver, ISO, and other styles

18

Bender, Marco. "Randomized Approximation and Online Algorithms for Assignment Problems." Doctoral thesis, 2015. http://hdl.handle.net/11858/00-1735-0000-0022-6016-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Sautié, Castellanos Miguel. "Assessing the robustness of genetic codes and genomes." Thesis, 2020. http://hdl.handle.net/1866/24333.

Full text

Abstract:

Deux approches principales existent pour évaluer la robustesse des codes génétiques et des séquences de codage. L'approche statistique est basée sur des estimations empiriques de probabilité calculées à partir d'échantillons aléatoires de permutations représentant les affectations d'acides aminés aux codons, alors que l'approche basée sur l'optimisation repose sur le pourcentage d’optimisation, généralement calculé en utilisant des métaheuristiques. Nous proposons une méthode basée sur les deux premiers moments de la distribution des valeurs de robustesse pour tous les codes génétiques possibl

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!