The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper presents a novel multi-agent architecture for meeting scheduling. The proposed architecture is a new Hybrid Multi-Agent Architecture (HMAA) that generates new heuristics for solving NP-hard problems. Moreover, the paper investigates the feasibility of running computationally intensive algorithms on multi-agent architectures while preserving the ability of small agents to run on small devices,...
The class scheduling problem can be modeled by a graph where the vertices and edges represent the courses and the common students, respectively. The problem is to assign the courses a given number of time slots (colors), where each time slot can be used for a given number of class rooms. The Vertex Coloring (VC) algorithm is a polynomial time algorithm which produces a conflict free solution using...
In grid computing the number of resources and tasks is usually very large, which makes the scheduling task very complex optimization problem. Genetic algorithms (GAs) have been broadly used to solve these NP-complete problems efficiently. On the other hand, the standard genetic algorithm (SGA) is too slow when used in a realistic scheduling due to its time consuming iteration. This paper proposes...
Uplink scheduling in LTE systems is considered. Two low complexity heuristic algorithms for suboptimal subcarrier allocation are proposed and compared to other algorithms in the literature. Throughput and fairness analysis of the different algorithms are performed via Monte-Carlo simulations. The proposed algorithms are utility maximizing algorithms that can be used with various utility functions...
In this paper we propose a heuristic inter-cell coordination scheme for scheduling users in an opportunistic multi-cell network. The scheme is mainly designed to be implemented in the uplink of networks that utilize the third generation partnership project long term evolution (3GPP LTE) technology. The objective of the scheme is to coordinate the uplink transmission in neighboring cells such that...
In this paper, we present an analytic model and methodology to determine optimal scheduling policy that involves two dimension space allocation: time and code, in high speed downlink packet access (HSDPA) system. A discrete stochastic dynamic programming model for the HSDPA downlink scheduler is presented. Value iteration is then used to solve for optimal policy. This framework is used to find the...
To alleviate the problems of network bottleneck in speed networks, it is important to have faster switching and certainly efficient scheduling algorithms. Optical switches are becoming more popular because of their faster switching speeds and higher reliability as compared to their electronic counterpart. Suitable scheduling algorithms are needed to be developed that will improve the utilization of...
In this paper, we use the Markov Decision Process (MDP) technique to find the optimal code allocation policy in High-Speed Downlink Packet Access (HSDPA) networks. A discrete stochastic dynamic programming model for the HSDPA downlink scheduler is presented. The model then is solved numerically using value iteration. The system performance when using the resulted optimal policy as compared to Round...
The employee timetabling problem (ETP) is concerned with assigning a number of employees into a given set of shifts over a fixed period of time, e.g. a week, while meeting the employee's preferences and organizational work regulations. The problem also attempts to optimize the performance criteria and distribute the shifts equally among the employees. The problem is considered a classical NP-complete...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.