Thematische Bibliographien / Resource allocations problems

Auswahl der wissenschaftlichen Literatur zum Thema „Resource allocations problems“

Autor: Grafiati
Veröffentlicht am 25. Mai 2024

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Inhaltsverzeichnis

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Resource allocations problems" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Resource allocations problems"

1

Lin, Shan-Shan. „Due-Window Assignment and Resource Allocation Scheduling with Truncated Learning Effect and Position-Dependent Weights“. Discrete Dynamics in Nature and Society 2020 (08.10.2020): 1–7. http://dx.doi.org/10.1155/2020/9260479.

Der volle Inhalt der Quelle
Annotation:
This paper studies single-machine due-window assignment scheduling problems with truncated learning effect and resource allocation simultaneously. Linear and convex resource allocation functions under common due-window (CONW) assignment are considered. The goal is to find the optimal due-window starting (finishing) time, resource allocations and job sequence that minimize a weighted sum function of earliness and tardiness, due window starting time, due window size, and total resource consumption cost, where the weight is position-dependent weight. Optimality properties and polynomial time algorithms are proposed to solve these problems.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Fu, Lei, Junmin Wang, Shiwu Wang, Hongxi Peng und Zihan Gui. „Study of Water Resource Allocation and Optimization Considering Reclaimed Water in a Typical Chinese City“. Sustainability 15, Nr. 1 (02.01.2023): 819. http://dx.doi.org/10.3390/su15010819.

Der volle Inhalt der Quelle
Annotation:
Reclaimed water is considered to be an important alternative to freshwater to solve the imbalance between the supply and demand of regional water resources; it is also recognized as an effective tool for alleviating ecological problems caused by insufficient water flow. Yiwu City is a typical area experiencing a water shortage in southeastern China because the regional water resources are limited. In this study, the multiple water resource allocations in Yiwu City are optimized, the complex coupling model of multiple water resource allocation is established, and both the economic and ecological effects of multiple water resource allocation in Yiwu City are simulated and analyzed. The simulation results of optimizing the multiple water resource allocations show an efficient way of reclaimed water utilization in this typical Chinese city. In order to ensure the future economic and social development of Yiwu City, it is necessary to introduce reclaimed water into different fields, such as residential water, industrial water, agricultural water, and environmental water. Reclaimed water has also proven to have a high capability for pollutant control and reduction, which is also important to the ecology and environmental protection.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Budish, Eric, Yeon-Koo Che, Fuhito Kojima und Paul Milgrom. „Designing Random Allocation Mechanisms: Theory and Applications“. American Economic Review 103, Nr. 2 (01.04.2013): 585–623. http://dx.doi.org/10.1257/aer.103.2.585.

Der volle Inhalt der Quelle
Annotation:
Randomization is commonplace in everyday resource allocation. We generalize the theory of randomized assignment to accommodate multi-unit allocations and various real-world constraints, such as group-specific quotas (“controlled choice”) in school choice and house allocation, and scheduling and curriculum constraints in course allocation. We develop new mechanisms that are ex ante efficient and fair in these environments, and that incorporate certain non-additive substitutable preferences. We also develop a “utility guarantee” technique that limits ex post unfairness in random allocations, supplementing the ex ante fairness promoted by randomization. This can be applied to multi-unit assignment problems and certain two-sided matching problems. (JEL C78, D82)
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Etor, Comfort R., Ekpenyong E. Ekanem und Mary A. Sule. „Access and Resource Allocation to Education in Nigeria“. International Education Studies 13, Nr. 3 (18.02.2020): 79. http://dx.doi.org/10.5539/ies.v13n3p79.

Der volle Inhalt der Quelle
Annotation:
Access to education in Nigeria has attracted the attention of many Nigerians due to rising number of children and youths who are unable to gain admission into schools to actualize their educational and career dreams. Besides, there are also the issues of equitable and adequate resources to the existing schools to ensure qualitative education at all levels in Nigeria. This is the trust of this paper, as it examines the significance of access to education, equal educational opportunities, resource allocation to education and criteria for such allocations. The paper also attempts to highlight some problems and prospects of access and resource allocation to education in Nigeria.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Trang, Le Hong, und Hoang Huu Viet. „Optimally stable matchings for resource allocations“. Vietnam Journal of Science and Technology 60, Nr. 2 (21.04.2022): 257–69. http://dx.doi.org/10.15625/2525-2518/16107.

Der volle Inhalt der Quelle
Annotation:
The stable marriage problem (SMP) and its variants have received much attention in the literature due to their wide range of applications. One of their applications is resource allocation in network environments. In this paper, we consider two resource allocation problems. The first one is to maximize the performance of a system in the fog computing environment while maintaining a low cost. In the problem, the resource allocation task will be rewritten as the MAX-SMTI variant (i.e., finding the maximum cardinality stable matching of the stable marriage with ties and incomplete lists). It is then formulated under an integer linear program to solve. The best allocation can then be chosen to be the lowest cost one among stable matchings. In the same manner, another variant called MAX-HRT (i.e., finding the maximum cardinality stable matching of the hospital-residents with ties) is applied for the second application regarding the virtual machine allocation. By using MAX-SMTI and MAX-HRT models which are solved via integer linear programs, we aim to not only find stable matchings for the resource allocation problems but also maximum length matchings. Consequently, a maximum number of user requests should be served at a time. The models are implemented in C++ using the SCIP solver. Numerical experiments are conducted for large datasets and results are given to show the efficiency of the models.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Glazebrook, K. D. „Bounds for discounted stochastic scheduling problems“. Journal of Applied Probability 28, Nr. 4 (Dezember 1991): 791–801. http://dx.doi.org/10.2307/3214682.

Der volle Inhalt der Quelle
Annotation:
Suppose that π is a policy for resource allocation in a stochastic environment and π ∗ is an optimal policy. Two existing procedures for policy evaluation are described and compared. Both of these evaluate π by means of upper bounds on R(π ∗) – R(π), the total reward lost when making resource allocations according to π rather than π∗. The bounds developed by these two methods are called Type 1 and Type 2. We demonstrate by example that neither of these procedures dominates the other in the sense of always yielding tighter bounds. A modification to Type 2 bounds is proposed resulting in an improved procedure which always dominates the Type 1 approach.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Glazebrook, K. D. „Bounds for discounted stochastic scheduling problems“. Journal of Applied Probability 28, Nr. 04 (Dezember 1991): 791–801. http://dx.doi.org/10.1017/s0021900200042704.

Der volle Inhalt der Quelle
Annotation:
Suppose that π is a policy for resource allocation in a stochastic environment and π ∗ is an optimal policy. Two existing procedures for policy evaluation are described and compared. Both of these evaluate π by means of upper bounds on R(π ∗) – R(π), the total reward lost when making resource allocations according to π rather than π∗. The bounds developed by these two methods are called Type 1 and Type 2. We demonstrate by example that neither of these procedures dominates the other in the sense of always yielding tighter bounds. A modification to Type 2 bounds is proposed resulting in an improved procedure which always dominates the Type 1 approach.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Cigler, Ludek, und Boi Faltings. „Symmetric Subgame Perfect Equilibria in Resource Allocation“. Proceedings of the AAAI Conference on Artificial Intelligence 26, Nr. 1 (20.09.2021): 1326–32. http://dx.doi.org/10.1609/aaai.v26i1.8233.

Der volle Inhalt der Quelle
Annotation:
We analyze symmetric protocols to rationally coordinate on an asymmetric, efficient allocation in an infinitely repeated N-agent, C-resource allocation problems. (Bhaskar 2000) proposed one way to achieve this in 2-agent, 1-resource allocation games: Agents start by symmetrically randomizing their actions, and as soon as they each choose different actions, they start to follow a potentially asymmetric "convention" that prescribes their actions from then on. We extend the concept of convention to the general case of infinitely repeated resource allocation games with N agents and C resources. We show that for any convention, there exists a symmetric subgame perfect equilibrium which implements it. We present two conventions: bourgeois, where agents stick to the first allocation; and market, where agents pay for the use of resources, and observe a global coordination signal which allows them to alternate between different allocations. We define price of anonymity of a convention as the ratio between the maximum social payoff of any (asymmetric) strategy profile and the expected social payoff of the convention. We show that while the price of anonymity of the bourgeois convention is infinite, the market convention decreases this price by reducing the conflict between the agents.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Chen, Ye, Nikola Marković, Ilya O. Ryzhov und Paul Schonfeld. „Data-Driven Robust Resource Allocation with Monotonic Cost Functions“. Operations Research 70, Nr. 1 (Januar 2022): 73–94. http://dx.doi.org/10.1287/opre.2021.2145.

Der volle Inhalt der Quelle
Annotation:
Using Data to Allocate Resources Efficiently In city logistics systems, a fleet of vehicles is divided between service regions that function autonomously. Each region finds optimal routes for its own fleet and incurs costs accordingly. More vehicles lead to lower costs, but the trade-off is that fewer vehicles are left for other regions. Costs are difficult to quantify precisely because of demand uncertainty but can be estimated using data. The paper “Data-driven robust resource allocation with monotonic cost functions” by Chen, Marković, Ryzhov, and Schonfeld develops a principled risk-averse approach for two-stage resource allocation. The authors propose a new uncertainty model for decreasing cost functions and show how it can be leveraged to efficiently find resource allocations that demonstrably reduce the frequency of high-cost scenarios. This framework combines statistics and optimization in a novel way and is applicable to a general class of resource allocation problems, encompassing facility location, vehicle routing, and discrete-event simulation.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Cigler, L., und B. Faltings. „Symmetric Subgame-Perfect Equilibria in Resource Allocation“. Journal of Artificial Intelligence Research 49 (26.02.2014): 323–61. http://dx.doi.org/10.1613/jair.4166.

Der volle Inhalt der Quelle
Annotation:
We analyze symmetric protocols to rationally coordinate on an asymmetric, efficient allocation in an infinitely repeated N-agent, C-resource allocation problems, where the resources are all homogeneous. Bhaskar proposed one way to achieve this in 2-agent, 1-resource games: Agents start by symmetrically randomizing their actions, and as soon as they each choose different actions, they start to follow a potentially asymmetric "convention" that prescribes their actions from then on. We extend the concept of convention to the general case of infinitely repeated resource allocation games with N agents and C resources. We show that for any convention, there exists a symmetric subgame-perfect equilibrium which implements it. We present two conventions: bourgeois, where agents stick to the first allocation; and market, where agents pay for the use of resources, and observe a global coordination signal which allows them to alternate between different allocations. We define price of anonymity of a convention as a ratio between the maximum social payoff of any (asymmetric) strategy profile and the expected social payoff of the subgame-perfect equilibrium which implements the convention. We show that while the price of anonymity of the bourgeois convention is infinite, the market convention decreases this price by reducing the conflict between the agents.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Dissertationen zum Thema "Resource allocations problems"

1

Hicks, Dixon Kendall. „Applicability of computer spreadsheet simulation for solving resource allocations problems“. Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from the National Technical Information Service, 1993. http://handle.dtic.mil/100.2/ADA267436.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Vu, Dong Quan. „Models and solutions of strategic resource allocation problems : approximate equilibrium and online learning in Blotto games“. Electronic Thesis or Diss., Sorbonne université, 2020. https://accesdistant.sorbonne-universite.fr/login?url=https://theses-intra.sorbonne-universite.fr/2020SORUS120.pdf.

Der volle Inhalt der Quelle
Annotation:
Les problèmes d'allocation des ressources sont définis comme les situations concernant les décisions sur la distribution d’un budget limité afin d’optimiser un objectif. Beaucoup d'entre eux impliquent des interactions entre des décideurs compétitifs ; ils peuvent être bien capturés par des modèles de théorie des jeux. Dans cette thèse, nous choisissons d'étudier les jeux d'allocation de ressources. Nous nous concentrons principalement sur le jeu de Colonel Blotto (CB). Dans le jeu CB, deux joueurs compétitifs, chacun ayant un budget fixe, distribuent simultanément leurs ressources vers n champs de bataille. Chaque joueur évalue chaque champ de bataille avec une certaine valeur. Dans chaque champ de bataille, le joueur qui a l'allocation la plus élevée gagne la valeur correspondante tandis que l'autre obtient zéro. Le gain de chaque joueur est à ses gains cumulés sur tous les champs de bataille. Tout d'abord, nous modélisons plusieurs variantes et extensions du jeu CB comme jeux d'informations complètes à un coup. Notre première contribution est une classe d'équilibres approximatifs dans ces jeux et nous prouvons que l'erreur d'approximation est bien contrôlée. Deuxièmement, nous modélisons les jeux d'allocation de ressources avec des structures combinatoires comme des problèmes d'apprentissage en ligne pour étudier des situations impliquant des jeux séquentiels et des informations incomplètes. Nous établissons une connexion entre ces jeux et les problèmes de chemin le plus court en ligne (OSP). Notre deuxième contribution est un ensemble de nouveaux algorithmes d’OSP sous plusieurs paramètres de feedback qui améliorent des garanties de regret et du temps d'exécution
Resource allocation problems are broadly defined as situations involving decisions on distributing a limited budget of resources in order to optimize an objective. In particular, many of them involve interactions between competitive decision-makers which can be well captured by game-theoretic models. In this thesis, we choose to investigate resource allocation games. We primarily focus on the Colonel Blotto game (CB game). In the CB game, two competitive players, each having a fixed budget of resources, simultaneously distribute their resources toward n battlefields. Each player evaluates each battlefield with a certain value. In each battlefield, the player who has the higher allocation wins and gains the corresponding value while the other loses and gains zero. Each player's payoff is her aggregate gains from all the battlefields. First, we model several prominent variants of the CB game and their extensions as one-shot complete-information games and analyze players' strategic behaviors. Our first main contribution is a class of approximate (Nash) equilibria in these games for which we prove that the approximation error can be well-controlled. Second, we model resource allocation games with combinatorial structures as online learning problems to study situations involving sequential plays and incomplete information. We make a connection between these games and online shortest path problems (OSP). Our second main contribution is a set of novel regret-minimization algorithms for generic instances of OSP under several restricted feedback settings that provide significant improvements in regret guarantees and running time in comparison with existing solutions
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Muñoz, i. Solà Víctor. „Robustness on resource allocation problems“. Doctoral thesis, Universitat de Girona, 2011. http://hdl.handle.net/10803/7753.

Der volle Inhalt der Quelle
Annotation:
En problemes d'assignació de recursos, normalment s'han de tenir en compte les incerteses que poden provocar canvis en les dades inicials. Aquests canvis dificulten l'aplicabilitat de les planificacions que s'hagin fet inicialment.
Aquesta tesi se centra en l'elaboració de tècniques que consideren la incertesa alhora de cercar solucions robustes, és a dir solucions que puguin continuar essent vàlides encara que hi hagi canvis en l'entorn. Particularment, introduïm el concepte de robustesa basat en reparabilitat, on una solució robusta és una que pot ser reparada fàcilment en cas que hi hagi incidències. La nostra aproximació es basa en lògica proposicional, codificant el problema en una fórmula de satisfactibilitat Booleana, i aplicant tècniques de reformulació per a la generació de solucions robustes. També presentem un mecanisme per a incorporar flexibilitat a les solucions robustes, de manera que es pugui establir fàcilment el grau desitjat entre robustesa i optimalitat de les solucions.
Resource allocation problems usually include uncertainties that can produce changes in the data of the problem. These changes may cause difficulties in the applicability of the solutions.
This thesis is focused in the elaboration of techniques that take into account such uncertainties while searching for robust solutions, i.e. solutions that can remain valid even if there are changes in the environment. Particularly, we introduce the concept of robustness based on reparability, where a robust solution is one that can be easily repaired when unexpected events occur. Our approach is based in propositional logic, encoding the problem to a Boolean formula, and applying reformulation techniques in order to generate robust solutions. Additionally, we present a mechanism to incorporate flexibility to the robust solutions, so that one can easily set the desired degree between optimality and robustness.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Hosein, Patrick Ahamad. „A class of dynamic nonlinear resource allocation problems“. Thesis, Massachusetts Institute of Technology, 1989. http://hdl.handle.net/1721.1/14258.

Der volle Inhalt der Quelle
Annotation:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1990.
Includes bibliographical references (leaves 213-214).
by Patrick Ahamad Hosein.
Ph.D.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Lakshmanan, Hariharan 1980. „Resource allocation problems in stochastic sequential decision making“. Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/47736.

Der volle Inhalt der Quelle
Annotation:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 2009.
Includes bibliographical references (p. 159-162).
In this thesis, we study resource allocation problems that arise in the context of stochastic sequential decision making problems. The practical utility of optimal algorithms for these problems is limited due to their high computational and storage requirements. Also, an increasing number of applications require a decentralized solution. We develop techniques for approximately solving certain class of resource allocation problems that arise in the context of stochastic sequential decision making problems that are computationally efficient with a focus on decentralized algorithms where appropriate. The first resource allocation problem that we study is a stochastic sequential decision making problem with multiple decision makers (agents) with two main features 1) Partial observability Each agent may not have complete information regarding the system 2) Limited Communication - Each agent may not be able to communicate with all other agents at all times. We formulate a Markov Decision Process (MDP) for this problem. The features of partial observability and limited communication impose additional computational constraints on the exact solution of the MDP. We propose a scheme for approximating the optimal Q function and the optimal value function associated with this MDP as a linear combination of preselected basis functions. We show that the proposed approximation scheme leads to decentralization of the agents' decisions thereby enabling their implementation under limited communication. We propose a linear program, ALP, for selecting the parameters for combining the basis functions. We establish bounds relating the approximation error due to the choice of the parameters selected by the ALP with the best possible error given the choice of basis functions.
(cont.) Motivated by the need for a decentralized solution to the ALP, which is equivalent to a resource allocation problem with separable, concave objective function, we analyze a general class of resource allocation problems with separable concave objective functions. We propose a distributed algorithm for this class of problems when the objective function is differentiable and establish its convergence and convergence rate properties. We develop a smoothing scheme for non-differentiable objective functions and extend the algorithm for this case. Finally, we build on these results to extend the decentralized algorithm to accommodate non-negativity constraints on the resources. Numerical investigations on the performance of the developed algorithm show that our algorithm is competitive with its centralized counterpart. The second resource allocation problem that we study is the problem of optimally accepting or rejecting arriving orders in a Make-To-Order (MTO) manufacturing firm. We model the production facility of the MTO manufacturing firm as a queue and view the time of the production facility as a resource that needs to be optimally allotted between current and future orders. We formulate the Order Acceptance Problem under two arrival processes - Poisson process (OAP-P), and Bernoulli Process (OAP-B) and formulate both problems as MDPs. We provide insights into the structure of the optimal order acceptance policy for OAP-B under the assumption of First Come First Served (FCFS) scheduling of accepted orders.
(cont.) We investigate a class of randomized order acceptance policies for OAP-B called static policies that are practically relevant due to their ease of implementation and develop a procedure for computing the policy gradient for any static policy. Using these results for OAP-B, we propose 4 heuristics for OAP-P. We numerically investigate the performance of the proposed heuristics and compare their performance with other heuristics reported in literature. One of our proposed heuristics, FCFS-ValueFunction outperforms other heuristics under a variety of conditions while also being easy to implement.
by Hariharan Lakshmanan.
Ph.D.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Chen, Gang. „On scheduling and resource allocation problems with uncertainty“. [Gainesville, Fla.] : University of Florida, 2003. http://purl.fcla.edu/fcla/etd/UFE0002303.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Vemulapalli, Manish Goldie. „Resource allocation problems in communication and control systems“. Diss., University of Iowa, 2012. https://ir.uiowa.edu/etd/3547.

Der volle Inhalt der Quelle
Annotation:
Resource allocation in control and communication systems constitutes the distribution of (finite) system resources in a way that achieves maximum system functionality and or cost effectiveness. Specific resource allocation problems in subband coding, Discrete Multi-tone modulation based systems and autonomous multi-agent control are addressed in this thesis. In subband coding, the number of bits used (out of a target bit budget) to code a sub- band signal are allocated in a way that minimizes the coding distortion. In Discrete Multi-tone modulation based systems, high bit rate streams are split into several parallel lower rate streams. These individual data streams are transmitted over different subchannels. Given a target bit rate, the goal of resource allocation is to distribute the bits among the different subchannels such that the total transmitted power is minimized. The last problem is achieving stable control of a fleet of autonomous agents by utilizing the available communication resources (such as transmitted Power and bandwidth) as effectively as possible. We present an efficient bit loading algorithm that applies to both subband coding and single-user multicarrier communication system. The goal is to effect an optimal distribution of B bits among N subchannels (subbands) to achieve a minimum transmitted power (distortion error variance) for multicarrier (subband coding) systems. All the algorithms in literature, except a few (which provides a suboptimal solution), have run times that increase with B. By contrast, we provide an algorithm that solves the aforementioned problems exactly and with a complexity (given by O(N log(N)),) which is dependent only on N. Bit loading in multi-user multicarrier systems not only involves the distribution of bit rates across the subchannels but also the assignment of these subchannels to different users. The motivation for studying suboptimal bit allocation is underscored by implicit and explicit claims made in some of the papers which present suboptimal bit loading algorithms, without a formal proof, that the underlying problem is NP-hard. Consequently, for no other reason than the sake of completeness, we present a proof for NP-hardness of the multiuser multicarrier bit loading problem, thereby formally justifying the search for suboptimal solutions. There has been a growing interest in the area of cooperative control of networks of mobile autonomous agents. Applications for such a set up include organization of large sensor networks, air traffic control, achieving and maintaining formations of unmanned vehicles operating under- water, air traffic control etc. As in Abel et al, our goal is to devise control laws that, require minimal information exchange between the agents and minimal knowledge on the part of each agent of the overall formation objective, are fault tolerant, scalable, and easily reconfigurable in the face of the loss or arrival of an agent, and the loss of a communication link. A major drawback of the control law proposed in Abel et al is that it assumes all agents can exchange information at will. This is fine if agents acquire each others state information through straightforward sensing. If however, state information is exchanged through broadcast commu- nication, this assumption is highly unrealistic. By modifying the control law presented in Abel et al, we devise a scheme that allows for a sharing of the resource, which is the communication channel, but also achieves the desired formation stably. Accordingly we modify the control law presented in [23] to be compatible with networks constrained by MAC protocols.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Zhu, Zhanguo. „Scheduling problems with consumable resource allocation and learning effect“. Troyes, 2011. http://www.theses.fr/2011TROY0011.

Der volle Inhalt der Quelle
Annotation:
Cette thèse s’intéresse aux problèmes d’ordonnancement à une machine où les durées opératoires des tâches peuvent dépendre de différents paramètres. Dans les problèmes d’ordonnancement traditionnels, les durées opératoires sont souvent supposées constantes. Cette hypothèse n’est pas toujours valable dans certains problèmes réels d'ordonnancement en production ou en service. La durée opératoire d'une tâche peut en effet varier selon la quantité de ressources consommables allouées, la performance des opérateurs et l’état des ressources matérielles utilisées, etc. L’ordonnancement optimal peut donc être différent. Nous nous intéressons à quatre problèmes d’ordonnancement avec différentes configurations des facteurs suivants : changement de productivité par la maintenance, quantité de ressources consommables utilisées, effet d’apprentissage, technologie de groupe, temps de réglage et fenêtres horaires dues. Le changement de productivité par la maintenance, qui reflète l'état des machines, est un facteur clé de cette thèse. Il est présent dans tous les problèmes étudié, sauf pour le premier. Cette thèse considère globalement les nouvelles caractéristiques telles que les ressources consommables, les ressources humaines et les machines bien qu'elle soit organisée sous l'angle des ressources consommables et l'effet d'apprentissage. Pour chaque problème considéré, nous construisons d’abord un modèle mathématique. Après l’analyse du modèle construit, nous proposons un algorithme exact de résolution. Enfin la complexité de l’algorithme est étudiée
This thesis addresses scheduling problems with consumable resource allocation and learning effect. In traditional deterministic scheduling problems, job processing times are assumed to be constant. However, this assumption is not always appropriate in many real life production and service operations since practical issues, including limited consumable resources, human characteristics (learning effect), usually affect job processing times, which change the whole scheduling process and lead to new characteristics to decision-making and scheduling results. It is therefore necessary and reasonable to study scheduling problems with these features. Based on the above two issues, this thesis mainly concerns four scheduling problems including group technology, rate-modifying activity (RMA), past-sequence-dependent setup times, and due-windows. It is worth to note that RMA which reflects the situations of ma-chines is also a key factor considered. It is involved in all studied problems except the first one. This thesis is also a work considering comprehensively new characteristics of consumable resources, human, and machines although we just organize this thesis from the viewpoint of consumable resource allocation and learning effect. For each problem, we propose a scheduling model, design an exact algorithm, and analyze the complexity
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Zhao, Haiquan. „Measurement and resource allocation problems in data streaming systems“. Diss., Georgia Institute of Technology, 2010. http://hdl.handle.net/1853/34785.

Der volle Inhalt der Quelle
Annotation:
In a data streaming system, each component consumes one or several streams of data on the fly and produces one or several streams of data for other components. The entire Internet can be viewed as a giant data streaming system. Other examples include real-time exploratory data mining and high performance transaction processing. In this thesis we study several measurement and resource allocation optimization problems of data streaming systems. Measuring quantities associated with one or several data streams is often challenging because the sheer volume of data makes it impractical to store the streams in memory or ship them across the network. A data streaming algorithm processes a long stream of data in one pass using a small working memory (called a sketch). Estimation queries can then be answered from one or more such sketches. An important task is to analyze the performance guarantee of such algorithms. In this thesis we describe a tail bound problem that often occurs and present a technique for solving it using majorization and convex ordering theories. We present two algorithms that utilize our technique. The first is to store a large array of counters in DRAM while achieving the update speed of SRAM. The second is to detect global icebergs across distributed data streams. Resource allocation decisions are important for the performance of a data streaming system. The processing graph of a data streaming system forms a fork and join network. The underlying data processing tasks consists of a rich set of semantics that include synchronous and asynchronous data fork and data join. The different types of semantics and processing requirements introduce complex interdependence between various data streams within the network. We study the distributed resource allocation problem in such systems with the goal of achieving the maximum total utility of output streams. For networks with only synchronous fork and join semantics, we present several decentralized iterative algorithms using primal and dual based optimization techniques. For general networks with both synchronous and asynchronous fork and join semantics, we present a novel modeling framework to formulate the resource allocation problem, and present a shadow-queue based decentralized iterative algorithm to solve the resource allocation problem. We show that all the algorithms guarantee optimality and demonstrate through simulation that they can adapt quickly to dynamically changing environments.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Celik, Melih. „Resource allocation problems under uncertainty in humanitarian supply chains“. Diss., Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/52302.

Der volle Inhalt der Quelle
Annotation:
With the increasing effect of disasters and long term issues on human well-being and economy over the recent years, effective management of humanitarian supply chains has become more important. This thesis work focuses on three problems in humanitarian supply chains where uncertainty is inherent, namely (i) post-disaster debris clearance with uncertain debris amounts, (ii) allocation of a health/humanitarian commodity in a developing country setting with multiple demand types, and (iii) distribution of specialized nutritious foods by a large scale humanitarian organization. In each of the three parts, the problem is formally defined, and a novel optimal solution approach incorporating the inherent uncertainty in the environment and updates is proposed. In cases where optimal models cannot be solved within reasonable time, novel heuristics are developed. Through structural analysis and computational experiments based on real data, the proposed approaches are compared to those that ignore the uncertainty in the environment and/or updates of information as new data becomes available. Using computational experiments, the proposed approaches are compared to those that are applied in practice, and the aspects of the system where performance improvements are more significant are analyzed.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Bücher zum Thema "Resource allocations problems"

1

Naoki, Katoh, Hrsg. Resource allocation problems: Algorithmic approaches. Cambridge, Mass: MIT Press, 1988.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Wang, Xinshang. Online Algorithms for Dynamic Resource Allocation Problems. [New York, N.Y.?]: [publisher not identified], 2017.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

1948-, Langholtz Harvey J., Hrsg. Resource-allocation behavior. Boston: Kluwer Academic Publishers, 2003.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Mark, Isaac R., und Plott Charles R, Hrsg. The allocation of scarce resources: Experimental economics and the problem of allocating airport slots. Boulder: Westview Press, 1989.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Salzhanit︠s︡yn, A. I. Sovremennye problemy razvitii︠a︡ materialʹnoĭ bazy otrasleĭ sot︠s︡ialʹnoĭ sfery Rossii. Moskva: Izd-vo OOO "ProfVariant", 2002.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Buenaventura, Elioth Mirsha Sanabria. On the Misclassification Cost Problem and Dynamic Resource Allocation Models for EMS. [New York, N.Y.?]: [publisher not identified], 2022.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Rahders, Ralf. Verfahren und Probleme der Bestimmung des optimalen Werbebudgets: Eine modellorientierte Analyse unter besonderer Berücksichtigung dynamischer Aspekte und Entscheidungen bei mehrfacher Zielsetzung. Idstein: Schulz-Kirchner, 1989.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Köckeritz, Antje. Distributing medical resources: An application of cooperative bargaining theory to an allocation problem in medicine. Frankfurt am Main: Peter Lang, 2012.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

United, States Congress House Committee on Government Reform Subcommittee on National Security Veterans Affairs and International Relations. VA health care: Structural problems, superficial solutions : hearing before the Subcommittee on National Security, Veterans Affairs, and International Relations of the Committee on Government Reform, House of Representatives, One Hundred Seventh Congress, second session, May 14, 2002. Washington: U.S. G.P.O., 2003.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

An inquiry into well-being and destitution. Oxford: Clarendon Press, 1993.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Buchteile zum Thema "Resource allocations problems"

1

Balicki, J., und Z. Kitowski. „Hopfield’s Artificial Neural Networks In Multiobjective Optimization Problems of Resource Allocations Control“. In ROMANSY 11, 355–62. Vienna: Springer Vienna, 1997. http://dx.doi.org/10.1007/978-3-7091-2666-0_41.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Katoh, Naoki, und Toshihide Ibaraki. „Resource Allocation Problems“. In Handbook of Combinatorial Optimization, 905–1006. Boston, MA: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4613-0303-9_14.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Katoh, Naoki, Akiyoshi Shioura und Toshihide Ibaraki. „Resource Allocation Problems“. In Handbook of Combinatorial Optimization, 2897–988. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4419-7997-1_44.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Yang, Song, Nan He, Fan Li und Xiaoming Fu. „Resource Allocation Problems Formulation and Analysis“. In Resource Allocation in Network Function Virtualization, 7–22. Singapore: Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-19-4815-2_2.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Parsaeefard, Saeedeh, Ahmad Reza Sharafat und Nader Mokari. „Nonconvex Robust Problems“. In Robust Resource Allocation in Future Wireless Networks, 145–231. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-50389-9_4.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Stańczak, Sławomir, Marcin Wiczanowski und Holger Boche. „Chapter 5: Resource Allocation Problem in Communications Networks“. In Resource Allocation in Wireless Networks, 91–128. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11818762_5.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Zhang, Donghui, und Yang Du. „Resource Allocation Problems in Spatial Databases“. In Encyclopedia of Database Systems, 1–6. New York, NY: Springer New York, 2014. http://dx.doi.org/10.1007/978-1-4899-7993-3_315-2.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Zhang, Donghui, und Yang Du. „Resource Allocation Problems in Spatial Databases“. In Encyclopedia of Database Systems, 2419–23. Boston, MA: Springer US, 2009. http://dx.doi.org/10.1007/978-0-387-39940-9_315.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Moulin, Hervé, und William Thomson. „Axiomatic Analysis of Resource Allocation Problems“. In Social Choice Re-examined, 101–20. London: Palgrave Macmillan UK, 1997. http://dx.doi.org/10.1007/978-1-349-25849-9_9.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Zhang, Donghui, und Yang Du. „Resource Allocation Problems in Spatial Databases“. In Encyclopedia of Database Systems, 3216–21. New York, NY: Springer New York, 2018. http://dx.doi.org/10.1007/978-1-4614-8265-9_315.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Resource allocations problems"

1

Yin, Steven, Shatian Wang, Lingyi Zhang und Christian Kroer. „Dominant Resource Fairness with Meta-Types“. In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/68.

Der volle Inhalt der Quelle
Annotation:
Inspired by the recent COVID-19 pandemic, we study a generalization of the multi-resource allocation problem with heterogeneous demands and Leontief utilities. Unlike existing settings, we allow each agent to specify requirements to only accept allocations from a subset of the total supply for each resource. These requirements can take form in location constraints (e.g. A hospital can only accept volunteers who live nearby due to commute limitations). This can also model a type of substitution effect where some agents need 1 unit of resource A \emph{or} B, both belonging to the same meta-type. But some agents specifically want A, and others specifically want B. We propose a new mechanism called Dominant Resource Fairness with Meta Types which determines the allocations by solving a small number of linear programs. The proposed method satisfies Pareto optimality, envy-freeness, strategy-proofness, and a notion of sharing incentive for our setting. To the best of our knowledge, we are the first to study this problem formulation, which improved upon existing work by capturing more constraints that often arise in real life situations. Finally, we show numerically that our method scales better to large problems than alternative approaches.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Vu, Dong Quan, Patrick Loiseau und Alonso Silva. „Efficient Computation of Approximate Equilibria in Discrete Colonel Blotto Games“. In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/72.

Der volle Inhalt der Quelle
Annotation:
The Colonel Blotto game is a famous game commonly used to model resource allocation problems in many domains ranging from security to advertising. Two players distribute a fixed budget of resources on multiple battlefields to maximize the aggregate value of battlefields they win, each battlefield being won by the player who allocates more resources to it. The continuous version of the game---where players can choose any fractional allocation---has been extensively studied, albeit only with partial results to date. Recently, the discrete version---where allocations can only be integers---started to gain traction and algorithms were proposed to compute the equilibrium in polynomial time; but these remain computationally impractical for large (or even moderate) numbers of battlefields. In this paper, we propose an algorithm to compute very efficiently an approximate equilibrium for the discrete Colonel Blotto game with many battlefields. We provide a theoretical bound on the approximation error as a function of the game's parameters. We also propose an efficient dynamic programming algorithm in order to compute for each game instance the actual value of the error. We perform numerical experiments that show that the proposed strategy provides a fast and good approximation to the equilibrium even for moderate numbers of battlefields
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Sadok, Hugo, Miguel Elias Mitre Campista und Luis Henrique Maciel Kosmalski Costa. „Improving Software Middleboxes and Datacenter Task Schedulers“. In XXXVII Simpósio Brasileiro de Redes de Computadores e Sistemas Distribuídos. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/sbrc_estendido.2019.7780.

Der volle Inhalt der Quelle
Annotation:
Shared systems have contributed to the popularity of many technologies. However, these systems often confront a common challenge: to ensure that resources are fairly divided without compromising utilization efficiency. In this master's thesis we look at this problem in two distinct systems---software middleboxes and datacenter task schedulers. We first present Sprayer, a system that uses packet spraying to load balance packets to cores in software middleboxes. Our design eliminates the imbalance problems of per-flow solutions and addresses the new challenges of handling shared flow states that come with packet spraying. Then, we present Stateful Dominant Resource Fairness (SDRF), a task scheduling policy for datacenters that looks at past allocations and enforces fairness in the long run. SDRF reduces users' waiting time on average and improves fairness by increasing the number of completed tasks for users with lower demands, with small impact on high-demand users.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Sadok, Hugo, Miguel Elias M. Campista und Luis Henrique M. K. Costa. „Improving Software Middleboxes and Datacenter Task Schedulers“. In XXXII Concurso de Teses e Dissertações da SBC. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/ctd.2019.6334.

Der volle Inhalt der Quelle
Annotation:
Shared systems have contributed to the popularity ofmany technolo- gies. However, these systems often confront a common challenge: to ensure that resources are fairly divided without compromising utilization efficiency. In this master’s thesis we look at this problem in two distinct systems—software mid- dleboxes and datacenter task schedulers. We first present Sprayer, a system that uses packet spraying to load balance packets to cores in software middleboxes. Our design eliminates the imbalance problems of per-flow solutions and ad- dresses the new challenges ofhandling shared flow states that come with packet spraying. Then, we present Stateful Dominant Resource Fairness (SDRF), a task scheduling policy for datacenters that looks at past allocations and en- forces fairness in the long run. SDRF reduces users’ waiting time on average and improves fairness by increasing the number of completed tasks for users with lower demands, with small impact on high-demand users
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Yuen, Sheung Man, und Warut Suksompong. „Approximate Envy-Freeness in Graphical Cake Cutting“. In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/326.

Der volle Inhalt der Quelle
Annotation:
We study the problem of fairly allocating a divisible resource in the form of a graph, also known as graphical cake cutting. Unlike for the canonical interval cake, a connected envy-free allocation is not guaranteed to exist for a graphical cake. We focus on the existence and computation of connected allocations with low envy. For general graphs, we show that there is always a 1/2-additive-envy-free allocation and, if the agents' valuations are identical, a (2+\epsilon)-multiplicative-envy-free allocation for any \epsilon > 0. In the case of star graphs, we obtain a multiplicative factor of 3+\epsilon for arbitrary valuations and 2 for identical valuations. We also derive guarantees when each agent can receive more than one connected piece. All of our results come with efficient algorithms for computing the respective allocations.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Kyropoulou, Maria, Warut Suksompong und Alexandros A. Voudouris. „Almost Envy-Freeness in Group Resource Allocation“. In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/57.

Der volle Inhalt der Quelle
Annotation:
We study the problem of fairly allocating indivisible goods between groups of agents using the recently introduced relaxations of envy-freeness. We consider the existence of fair allocations under different assumptions on the valuations of the agents. In particular, our results cover cases of arbitrary monotonic, responsive, and additive valuations, while for the case of binary valuations we fully characterize the cardinalities of two groups of agents for which a fair allocation can be guaranteed with respect to both envy-freeness up to one good (EF1) and envy-freeness up to any good (EFX). Moreover, we introduce a new model where the agents are not partitioned into groups in advance, but instead the partition can be chosen in conjunction with the allocation of the goods. In this model, we show that for agents with arbitrary monotonic valuations, there is always a partition of the agents into two groups of any given sizes along with an EF1 allocation of the goods. We also provide an extension of this result to any number of groups.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

S. Sankar, Govind, Anand Louis, Meghana Nasre und Prajakta Nimbhorkar. „Matchings with Group Fairness Constraints: Online and Offline Algorithms“. In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/53.

Der volle Inhalt der Quelle
Annotation:
We consider the problem of assigning items to platforms in the presence of group fairness constraints. In the input, each item belongs to certain categories, called classes in this paper. Each platform specifies the group fairness constraints through an upper bound on the number of items it can serve from each class. Additionally, each platform also has an upper bound on the total number of items it can serve. The goal is to assign items to platforms so as to maximize the number of items assigned while satisfying the upper bounds of each class. This problem models several important real-world problems like ad-auctions, scheduling, resource allocations, school choice etc. We show that if the classes are arbitrary, then the problem is NP-hard and has a strong inapproximability. We consider the problem in both online and offline settings under natural restrictions on the classes. Under these restrictions, the problem continues to remain NP-hard but admits approximation algorithms with small approximation factors. We also implement some of the algorithms. Our experiments show that the algorithms work well in practice both in terms of efficiency and the number of items that get assigned to some platform.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Imran, Faisal, Khuram Shahzad, Aurangzeab Aurangzeab Butt und Jussi Kantola. „Structural challenges to adopt digital transformation in industrial organizations: A multiple case study“. In 13th International Conference on Applied Human Factors and Ergonomics (AHFE 2022). AHFE International, 2022. http://dx.doi.org/10.54941/ahfe1002231.

Der volle Inhalt der Quelle
Annotation:
Digital Transformation requires significant changes in industrial organization’s setting to remain relevant in this fast-paced environment. This calls for modifications in their organizational structures. The existing organizational structures of industrial organizations are mechanistic, while, digital transformation needs organic and flexible organizational structure. Therefore, the main aim of this study is to identify the main challenges that industrial organizations face in the process of modifying their mechanistic structures into organic structures. To explore these challenges, we conducted multiple case study from three global industrial organizations. We interviewed 41 middle to high-level management personnel. The results of this study highlight six main challenges that industrial organizations need to cope for structural modifications. These challenges are structural rigidity, traditional hierarchy, silos, problems with resource allocations, organizational size and old-fashioned-leadership.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Bott, Terry F., und Stephen W. Eisenhawer. „A Structured Approach to Resource Allocation“. In ASME/JSME 2004 Pressure Vessels and Piping Conference. ASMEDC, 2004. http://dx.doi.org/10.1115/pvp2004-2998.

Der volle Inhalt der Quelle
Annotation:
Allocating limited resources among competing candidates is an important problem in management. In this paper, we describe a structured and flexible approach to resource allocation using logic-evolved decision (LED) analysis. LED analysis uses logic models to generate an exhaustive set of competing alternatives and the inferential model that is used for preference ordering of these alternatives. The inferential models can use data in numerical, linguistic, or mixed forms; uncertainty in the evaluation results can be expressed using probabilistic- or linguistic-based methods. We illustrate the use of LED analysis for an allocation problem with numerical input data and for an allocation problem with only linguistic input data.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Biswas, Arpita, und Siddharth Barman. „Fair Division Under Cardinality Constraints“. In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/13.

Der volle Inhalt der Quelle
Annotation:
We consider the problem of fairly allocating indivisible goods, among agents, under cardinality constraints and additive valuations. In this setting, we are given a partition of the entire set of goods---i.e., the goods are categorized---and a limit is specified on the number of goods that can be allocated from each category to any agent. The objective here is to find a fair allocation in which the subset of goods assigned to any agent satisfies the given cardinality constraints. This problem naturally captures a number of resource-allocation applications, and is a generalization of the well-studied unconstrained fair division problem. The two central notions of fairness, in the context of fair division of indivisible goods, are envy freeness up to one good (EF1) and the (approximate) maximin share guarantee (MMS). We show that the existence and algorithmic guarantees established for these solution concepts in the unconstrained setting can essentially be achieved under cardinality constraints. Furthermore, focusing on the case wherein all the agents have the same additive valuation, we establish that EF1 allocations exist even under matroid constraints.
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Resource allocations problems"

1

Hero, Alfred, und Demosthenis Teneketzis. Detection and resource Allocation Problems in ATR Systems. Fort Belvoir, VA: Defense Technical Information Center, März 2002. http://dx.doi.org/10.21236/ada405534.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Pforr, Tobias, Fabian Pape und Steffen Murau. After the Allocation: What Role for the Special Drawing Rights System? Institute for New Economic Thinking Working Paper Series, März 2022. http://dx.doi.org/10.36687/inetwp180.

Der volle Inhalt der Quelle
Annotation:
In August 2021, the IMF made a new SDR allocation to help ease pandemic-induced financial strains in the Global South. This paper assesses the potential of the SDR system to address debtrelated problems in global finance. We analyze the SDR system as a web of interlocking balance sheets whose members can use SDR holdings—the system’s tradable assets—for conversion into usable currency as a perpetual low-interest loan or to make payments to each other. Using original IMF data, we study how the system has been practically used since 1990. Though widely perceived as a solution in search of a problem in the post-Bretton Woods era, we find that the SDR system provides three mechanisms through which IMF members borrow and lend usable currency to each other, with different strings attached: first, transactions by agreement; second, the IMF’s core lending facilities for which the SDR system offers additional resources; and third, IMF-sponsored Trusts which seek to harness the SDR system for development purposes and are the basis for the current idea of ‘voluntary channeling’. Overall, given the SDR system’s idiosyncratic accounting rules, the new allocation can improve the liquidity position of a country and offer some limited avenues for sovereign debt restructuring but comes with new interest and exchange rate risks. Voluntary channeling cannot happen without a wealth transfer, neither the SDR allocation nor the use of Trusts can overcome this problem. Still, Trusts can be a useful instrument to help with debt forgiveness and to ensure that borrowed funds are used for their intended purpose.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Blair, W. D., und G. A. Watson. Benchmark Problem for Radar Resource Allocation and Tracking Maneuvering Targets in the Presence of ECM. Fort Belvoir, VA: Defense Technical Information Center, September 1996. http://dx.doi.org/10.21236/ada286909.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Chen, Pan, Mei Ieng Lam, Tong Leong Si und Yu-Tao Xiang. Prevalence of poor sleep quality among the general population in China: a meta-analysis of epidemiological studies. INPLASY - International Platform of Registered Systematic Review and Meta-analysis Protocols, April 2023. http://dx.doi.org/10.37766/inplasy2023.4.0055.

Der volle Inhalt der Quelle
Annotation:
Review question / Objective: This study aims to examine the pooled prevalence of PSQ among the Chinese general population (i.e. community-dwelling residents) and explore its associated factors. Condition being studied: Knowing the prevalence of PSQ is critical for health professionals and policymakers to understand its impact on the general population and further formulate reasonable allocation of health resources, and develop appropriate prevention and intervention strategies to improve sleep-related health problems. Information sources: PubMed, PsycINFO, Web of Science, EMBASE, Wanfang database and China National Knowledge Infrastructure (CNKI) database.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Steiner, Roberto, Alberto Carrasquilla und Alberto Alesina. Decentralization in Colombia. Inter-American Development Bank, September 2002. http://dx.doi.org/10.18235/0008531.

Der volle Inhalt der Quelle
Annotation:
This working paper focuses on four issues: (i) the rules of allocation of fiscal resources to different localities; (ii) the rules concerning how localities can spend fiscal transfers from the center; (iii) the rules concerning the balance of local governments' budgets; and (iv) issues concerning incentives for local politicians. This working paper is organized as follows: Section 2 describes the current situation and problems related to fiscal decentralization in Colombia. Section 3 discusses the policy issues related to fiscal federalism with an 'eye' focused on those more relevant for Colombia. Section 4 illustrates our proposal for reforms.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Issa, Mohsen, Ali Alawieh und Hussein Daoud. Concrete Bridge Deck Crack Sealing. Illinois Center for Transportation, März 2024. http://dx.doi.org/10.36501/0197-9191/24-007.

Der volle Inhalt der Quelle
Annotation:
Bridge decks are prone to various types of cracking due to a combination of factors, including traffic loads, temperature variations, moisture, and chemical exposure. This report tackles the critical issue of bridge deck cracking by systematically dissecting the problem, exploring various crack types, and emphasizing the crucial inspection and categorization of cracks for effective remediation planning. The report focuses on the selection of appropriate sealants, considering regional conditions. It delves into remediation treatments, offering a spectrum of options based on National Bridge Inventory ratings, deck conditions, and crack characteristics. Additionally, the report classifies sealant products and introduces a cost-analysis framework, promoting well-rounded decision-making that balances short-term project costs with ongoing maintenance expenses. Serving as a valuable resource, the report equips decision-makers with knowledge and tools to optimize resource allocation, enhance bridge deck integrity, and improve maintenance practices.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Vargas, Fernando, Alejandro Rasteletti und Gustavo Crespi. Productivity in Services in Latin America and the Caribbean. Inter-American Development Bank, April 2014. http://dx.doi.org/10.18235/0006983.

Der volle Inhalt der Quelle
Annotation:
This paper studies productivity in Latin America and the Caribbean, with an emphasis on the service sector. It shows that the low levels of productivity observed in the region are not only a consequence of low productivity at the firm level, but also of misallocation of workers across firms. These problems are more severe in services than in manufacturing. We also found that the determinants of productivity and employment growth at the firm level are different in manufacturing and services. Furthermore, results suggest that institutional factors might be important for determining productivity growth and resource allocation, as there are large differences across countries in the region in the effect of productivity on employment growth as well as on the speed at which less productive firms can close their productivity gaps.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Corrales, Maria Elena, und Lourdes Alvarez. IDB-9: Evaluation of IDB-9 Commitments for Haiti. Inter-American Development Bank, März 2013. http://dx.doi.org/10.18235/0010521.

Der volle Inhalt der Quelle
Annotation:
The objective of this report is to assess the full and effective implementation of the Bank's support to Haiti in the wake of the 2010 earthquake, in fulfillment of the mandates of IDB-9, which included full debt forgiveness, delivery of concessional resources in 2010, and expansion of the Bank's Grant Facility to provide Haiti US$200 million per year for a period of 10 years (2011-2020), subject to annual approval by the Governors. The evaluation confirms that the financial mandates included in IDB-9 have been fulfilled. The Bank wrote off Haiti's debt and transferred resources to the Grant Facility to approve grants to the country over the amount previously established, for US$231.6 million in 2010. In 2011 and 2012, the Bank transferred US$200 million per year in Ordinary Capital resources to the Grant Facility. The Bank financed a program for an amount that exceeded the transfers made, totaling US$231.0 million in 2011 and US$228.0 million in 2012. As regards the Bank's role in catalyzing resources from other donors, there were intense efforts, and the Bank leveraged US$136 million in the period 2010-2012. That figure, however, is somewhat lower than for the period preceding the earthquake and the annual amounts received have fallen. Coordination of international donors has proven inadequate, given the challenges facing the country and the management and execution capacity of the Haitian government. In this context, the Bank's sector coordination work in some key sectors is both recognized and valued. The intervention strategy adopted by the Bank emphasized long-term efforts in the sectors where it had been operating, rather than reconstruction, and had very ambitious targets given the limited management capacities of the Government of Haiti. Execution problems, such as poor designs and preinvestment studies, combined with low execution and supervision capacity in executing units, limited the results of these programs. New programs for development in the northern hub, along with institutional support at the sectoral level, involve risks that need to be addressed in a timely manner to ensure results in the long term. Meanwhile, the urgent need for approval and disbursement of US$200 million each year for 10 years does open up new opportunities for establishing a long-term country strategy, but is hindered by the slow, complex process of institution building. The result is pressure on specialists from the Bank and in the country, and this does not necessarily lead to disbursements or to effective efforts to overcome the problems of Haitian society. Haiti remains a major challenge for the IDB, and international coordination is vital if progress is to be made in overcoming the country¿s urgent problems of poverty and low economic growth. In this regard, OVE believes that the effectiveness of the Bank's actions in Haiti will depend on assessing the constraints associated with country's fragile condition, redefining sector targets and outcomes in line with the context, and paying special attention to reconstruction efforts. Lastly, harmonizing approvals and disbursements with the actual implementation conditions in the executing agencies involved, and respecting the time-frames needed to provide assistance in institution building within the country through a segmented allocation strategy, would make it possible to ensure the Bank's sustained, long-term support.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Komba, Aneth, und Richard Shukia. An Analysis of the Basic Education Curriculum in Tanzania: The Integration, Scope, and Sequence of 21st Century Skills. Research on Improving Systems of Education (RISE), Februar 2023. http://dx.doi.org/10.35489/bsg-rise-wp_2023/129.

Der volle Inhalt der Quelle
Annotation:
This study generated evidence on whether or not the basic education curriculum is geared towards developing problem-solving, collaboration, creativity, and critical thinking skills among those who graduate from the basic education system. It was informed by a mixed methodology research approach. The data were collected using interviews and documentary review. The findings reveal that the intention to promote 21st century skills through the basic education system in Tanzania is clear, as it is stated in various policy documents, including the Education for Self-Reliance philosophy, the 2014 Education and Training Policy and the National Curriculum Framework for Basic and Teacher Education. Furthermore, these skills are clearly reflected in every curriculum and syllabus document, yet those who graduate from the basic and advanced secondary levels are claimed to lack these skills. This suggests a variation between the enacted and the intended curriculum. We conclude that certain system elements are weak, and hence threaten the effective implementation of the curriculum. These weak system elements include limited finance, a teacher shortage, and the lack of a teacher continuous professional development programme. This research suggests that due consideration should be given to provision of the resources required for the successful implementation of the curriculum. These include, allocation of sufficient funds, the employment of more teachers and the provision of regular continuous professional development for teachers as a way to strengthen the system elements that we identified.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Kavalsky, Basil, Jose Ignacio Sembler, Monika Huppi und Diether Beuermann. IDB-9: Knowledge Products. Inter-American Development Bank, März 2013. http://dx.doi.org/10.18235/0010524.

Der volle Inhalt der Quelle
Annotation:
The Inter-American Development Bank (IDB) has a diverse set of knowledge products: economic and sector work, knowledge products associated with loans, and a variety of non-reimbursable technical cooperation products (TCs) funded by either income from ordinary capital or donor trust funds. With growing emphasis on IDB's capacity to make effective non-financial contributions to its borrowers, there has been substantial focus on how to increase the development impact of TCs. This involves balancing client demand and the institution's own view of country and regional priorities. IDB has struggled to achieve this balance and to put in place supporting systems to manage and monitor TCs effectively. Since 2008 the definition and classification of TCs and guidance on how to manage them has changed almost yearly. The IDB-9 Agreement reflected both a general intention to make this area of IDB's work more effective, and a more specific mandate to look into the possibility of providing fee-based services in the future. This evaluation identified several areas in which there are continuing issues pertaining to TCs, some of which also relate to IDB's knowledge products more generally. First, the strategic alignment between TCs and lending products needs to be strengthened; it has improved somewhat in annual country programs, but needs to be strengthened in the periodic Country Strategies and overall. Second, the management of TCs is complicated by the various constraints imposed on the inter- and intrasectoral allocation of both ordinary capital and donor trust funds, and IDB Management's efforts to find ways to work around these constraints have met with limited success, as evidenced by the substantial under-utilization of available resources. Third, IDB does not have a system for monitoring and reporting on the results of TCs, and this needs to be rectified, given their importance to development effectiveness. Fourth, proposals for fee-based services have been slow to get off the ground, though some progress now appears likely. Finally, the accessibility of reports and studies is a long-standing problem, though Management has recently begun to address this more systematically with the development of a new system for data access.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Die Auswahlen zum Thema "Resource allocations problems" für konkrete Quellenarten können Sie auch interessieren:
Zeitschriftenartikel Dissertationen Bücher
Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!

Zur Bibliographie