نتایج جستجو برای: group scheduling
تعداد نتایج: 1045365 فیلتر نتایج به سال:
The problem of airline crew scheduling is studied, the different problems composing it are formulated and solution techniques are offered. Special emphasis is given to the set covering problem appearing in the rotation selection phase. An approach is presented, based on the group theoretic method, which allows the fast solution of problems with large sizes. Thesis Supervisor: Robert W. Simpson ...
We propose a novel approach for group elevator scheduling by formulating it as the maximization of submodular function under a matroid constraint. In particular, we propose to model the total waiting time of passengers using a quadratic Boolean function. The unary and pairwise terms in the function denote the waiting time for single and pairwise allocation of passengers to elevators, respective...
The increasing penetration of renewable energy sources, the demand for more energy efficient electricity production and the increase in distributed electricity generation causes a shift in the way electricity is produced and consumed. The downside of these changes in the electricity grid is that network stability and controllability becomes more difficult compared to the old situation. The new ...
Flexible flow shops are becoming increasingly common in industry practice because of higher workloads imposed by jobs on one or more stages, thus requiring two or more units of the same machine type. We present a methodology for solving this important problem, namely group scheduling, within the context of cellular manufacturing systems in order to minimize the total completion time of all grou...
Consider an event organizer who is trying to schedule a group meeting. Availability of agents is unknown to the organizer a priori, but the organizer may have probability estimates on availability of each agent for each date/time option. The organizer can ask an agent to reveal her availability, but it causes inconvenience for the agent, and thus the organizer wishes to find an agreeable outcom...
We consider the situation in which a group of agents are trying to find an agreeable time for a meeting. Each agent’s availability is governed by a known prior probability distribution, but the realization of it is private information. The goal (of the convener) is to find an agreeable time slot while optimizing in two dimensions: Expected time to reach agreement and expected inconvenience caus...
The definition of a generic Grid scheduling architecture is the concern of both the Open Grid Forum’s Grid Scheduling Architecture Research Group and a CoreGRID research group of the same name. Such an architecture should provide a blueprint for Grid system and middleware designers and assist them in linking their scheduling requirements to diverse existing solutions and standards. Based on wor...
Non-Orthogonal Multiple Access (NOMA) has been proposed as a new radio access technique for cellular networks an alternative to OMA (Orthogonal Access) in which the users of group (pairs or triples are considered this paper) allowed use wireless channel simultaneously. In paper, downlink single-input single-output SISO-NOMA, heuristic power allocation algorithm within is first attempts ensure t...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید