resource leveling and allocation are two basic categories for project management. the objective of resource allocation is to schedule activities so that a particular resource does not exceed a specific limit in any given project time period, while holding the project duration to a minimum. the resource leveling problem arises when there are sufficient resources available and it is necessary to ...

Many portfolio optimization problems deal with allocation of assets which carry a relatively high market price. Therefore, it is necessary to determine the integer value of assets when we deal with portfolio optimization. In addition, one of the main concerns with most portfolio optimization is associated with the type of constraints considered in different models. In many cases, the resulted p...

Hubs are facilities to collect arrange and distribute commodities in telecommunication networks, cargo delivery systems, etc. In this paper, an uncapacitated phub center problem in case of single allocation and also multiple allocation will be introduced in which travel times or transportation costs are considered as fuzzy parameters. Then, by proposing new methods, the presented problem is con...

The General Yard Allocation Problem (GYAP) is a resource allocation problem faced by the Port of Singapore Authority. Here, space allocation for cargo is minimized for all incoming requests for space required in the yard within time intervals. The GYAP is NP-hard for which we propose several heuristic algorithms, including Tabu Search, Simulated Annealing, Genetic Algorithms and the recently em...

We study the Student-Project Allocation problem (SPA), a generalisation of the classical Hospitals / Residents problem (HR). An instance of SPA involves a set of students, projects and lecturers. Each project is offered by a unique lecturer, and both projects and lecturers have capacity constraints. Students have preferences over projects, whilst lecturers have preferences over students. We pre...

We show that the Bandwidth Allocation problem in the ATM network model is NP-Complete. Based on that inference we suggest using the Genetic Algorithm technique to select a subset of calls from the set of incoming call requests for transmission, so that the available network bandwidth is utilized eeectively, thus maximizing the revenue generated while preserving the promised QoS.

We introduce and study the generalized stable allocation problem, an “ordinal” variant of the well-studied generalized assignment problem in which we seek a fractional assignment that is stable (in the same sense as in the classical stable marriage problem) with respect to a two-sided set of ranked preference lists. We develop an O(m logn) algorithm for solving this problem in a bipartite assig...

it is shown in [1] that the optimal downlink radio resource allocation for non-realtime traffic in cellular cdma/tdma networks can be mapped to a multi-dimensional multiple-choice knapsack problem (mmkp) which is np-hard. in this correspondence we propose a heuristic algorithm with polynomial time complexity for this problem. numerical results indicate significant computational performance impr...

Redundancy allocation is one of the common techniques to increase the reliability of the bridge systems. Many studies on the general redundancy allocation problems assume that the redundancy strategy for each subsystem is predetermined and fixed. In general, active redundancy has received more attention in the past. However, in real world, a particular system design contains both active and col...

Redundancy allocation problem is one of the most important problem in Reliability area. In this problem the reliability and availability of the systems maximized via allocating redundant components to sub-systems. a systems operates normally in its operational mode but fails in either opened or shorted modes. this paper presents a repairable k_out_of_n systems network model with common cause fa...