Data envelopment analysis (DEA) is an effective tool for supporting decision-makers to assess bankruptcy, uncertainty concepts including intervals, and game theory. The bankruptcy problem with the qualitative parameters is an economic problem under uncertainty. Accordingly, we combine the concepts of the DEA game theory and uncertain models as interval linear programming (ILP), which can be app...

Human error is a significant and ever-growing problem in the healthcare sector. In this study, resource allocation problem is considered along with human errors to optimize utilization of resources in an emergency department. The algorithm is composed of simulation, artificial neural network (ANN), design of experiment (DOE) and fuzzy data envelopment analysis (FDEA). It is a multi-response opt...

The allocation of virtual machines (VMs) to physical machines in data centers is a key optimization problem for cloud service providers. It is well known that the VM allocation problem contains the classic bin packing problem as special case. This paper investigates to what extent the existing approximability results on bin packing and its generalizations can be applied to the VM allocation pro...

The most creative step in synthesizing data paths executing software descriptions is the hardware allocation process. New algorithms for the simultaneous costlresource constrained allocation of registers, arithmetic units, and interconnect in a data path have been developed. The entire allocation process can be formulated as a two-dimensional placement problem of microinstructions in space and ...

This paper addresses resource allocation for sum throughput maximization in a sectorized two-cell downlink OFDMA systems impaired by multicell interference. It is well known that the optimization problem for this scenario is NPhard and combinational, which is here converted to a novel sum throughput maximization problem based on the intercell interference limitation. Then, two subclasses of thi...

In this paper we present two algorithms for a machine allocation problem occurring in manufacturing systems. For the two algorithms presented we prove worst-case performance ratios of 2 and 32 respectively. The machine allocation problem considered is a general convex resource allocation problem, which makes the algorithms applicable to a large variety of resource allocation problems. Numerical...

The exponential growth in the usage of mobile networks along with the increasing number of User Equipments (UEs) are exacerbating the scarcity of frequency resources. Dense frequency reuse on the downlink of multiuser Orthogonal Frequency Division Multiple Access networks leads to severe Inter-Cell Interference (ICI) problems. Resource and power allocation techniques are required to alleviate t...

the allocation of human resources to project activities in order to schedule them is one of the closest states to the actual conditions of scheduling problems. but regarding the fact that this problem belongs to the class of np-hard problems; so far the exact methods have only been able to solve the small size problems. in this study, the renewable resources are humans in a way that every staff...

in this study, a hierarchical hub location problem by considering different modes of transportation and maximum allowed delay is investigated. this study is done on iran’s express postal service with 2 days maximum delay in delivery considering ground and airport hubs. the problem is of the type of location and single allocation for collection, transfer and distribution of the shipments. all th...