Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
In this study, we propose a clustering technique based on FP-tree algorithm to group students based on the intended courses they will register for a given next semester. The goal of this clustering is to solve the problem of course's time scheduling that we encountered in previous semesters which prevented students from enrolling in some of these courses as they are being scheduled at the same time...
Resource-constrained project scheduling and configuration determine the progress of the construction and quality. This paper constructs a model for dynamic resources allocation and scheduling based on priority and fuzzy theory. And use ant colony algorithm with trust mechanism to solve it. The algorithm simulates ant feeling of mutual trust and act and is subject to significant interaction between...
Logistics service suppliers are expected to make a reasonable collection routes to reduce service cost and improve service level. In this paper, the vehicle scheduling and routing model is proposed to choose optimal collection routes and to minimize the total cost which is composed by transport cost, overtime cost, punitive fine and inventory cost. A modified saving algorithm which takes the total...
This paper proposes scheduling algorithms for assigning jobs with different release time and execution time, to machines with heterogeneous processor cardinality. We show that this scheduling problem is NP-complete, and propose dynamic programming to find the optimal schedules. Since the dynamic programming is time-consuming we propose techniques that improve the efficiency of the dynamic programming...
Different from the traditional topic detection and tracking (TDT) technologies primarily focus on detecting topic in local network domain, this paper proposes a cooperative alert topic detection model in distributed environment (named CATDM). The model abstracts the alert topic and represents it as the local alert case by analyzing the alert of campus network culture in depth. The model not only discovers...
Batching machines are encountered in many different environments. The batching machine is able to process a number of jobs simultaneously as a batch. The scheduling problem to minimize weighted number of tardy jobs on a single batching machine with family jobs is proposed. The batch size is assumed to be unbounded and the processing time of a batch is equal to the longest processing time of the jobs...
Aiming at dynamic and autonomic characteristics of grid market, this paper proposes a new resources set availability evaluation approach. It utilizes statistics method to describe resource availability and improves the availability of resources set effectively. Then a resources composing based batch scheduling algorithm framework is proposed. This algorithm considers resources set availability and...
Scheduling is one of the core steps to efficiently exploit the capabilities of heterogeneous distributed computing systems and it is also an appealing NP-complete problem. There is a number of heuristic and meta-heuristic algorithms that were tailored to deal with scheduling of independent jobs. In this paper we investigate the efficiency of differential evolution on the scheduling problem.
The resource-constrained project scheduling problem (RCPSP) is a typical combinatorial optimization problem. Base on the general model of ant colony algorithm for solving the RCPSP, this paper presents a new 2opt called PC-2opt which guarantees precedence constraints between activities. PC-2opt, which needn't to calculate the location of successors, could be directly used to solve the RCPSP, and improve...
Task scheduling still remains one of the most challenging problems to achieve high performance in heterogeneous computing environments in spite of numerous efforts. This paper presents a novel scheduling algorithm based on learning classifier system for heterogeneous computing environment. In the presented algorithm, XCS classifier system is used to find the optimal task assignment on different processors,...
Most of real-life scheduling problems are dynamic, where we do not know all the time variables of jobs in advance. In such uncertain environment, trustworthy scheduling effectively is a hot topic. In this paper we model the constraints in the dynamic scheduling problems by using CSP model. Moreover, we propose model the time constraint variables in logic way. Based on the constraint models, a constraint...
To ensure Quality of Service (QoS) for data centers, it is critical to enforce a fair share of storage resources between competing users. Interposed schedulers are one of the most practical methods for performance isolation. Most fair queuing-based proportional sharing algorithms for existing interposed scheduler are variants of counterparts designed for network routers and may result in breaking...
In this paper, we study the impact of task reallocations/migrations on a grid platform, composed of parallel resources, each supervised by a batch scheduler. Results of simulations using real life traces show that gains of 40% can be attained on the average waiting time of jobs even if tasks are initially mapped by a meta-scheduler on the cluster giving the best completion time.
This paper proposes to solve the generalized job-shop scheduling problem by using several original static and dynamic heuristics relying on the machines' potential load. We consider a generalized job-shop problem with unrelated parallel machines which can process the operations of the different jobs and, moreover, any precedence constraints between the operations are allowed. The objective is to minimize...
Stream scheduling strategy used in streaming media server can improve largely system service capability by increasing system efficiency and reducing bandwidth requirement. In this study, an incorporated scheduling strategy, which combines period-patching and batching scheduling strategy, is proposed. It uses period-patching scheduling to transmit the group-broadcasting streams, and then incorporates...
In large distributed systems, where shared resources are owned by distinct entities, there is a need to reflect resource ownership in resource allocation. An appropriate resource management system should guarantee that resource's owners have access to a share of resources proportional to the share they provide. In order to achieve that some policies can be used for revoking access to resources currently...
With the increasing prevalence of large scale cloud computing environments, how to place requested applications into available computing servers regarding to energy consumption has become an essential research problem, but existing application placement approaches are still not effective for live applications with dynamic characters. In this paper, we proposed a novel approach named EnaCloud, which...
Adhoc sensor networks are being considered for many novel applications. There are many challenges while designing the sensor based adhoc network but main constraint is the power consumption done by the sensor nodes. Many solutions have been proposed to save the power of the senor nodes which are based on routing and other methodology. Most of the studies have considered switching off of the radio...
The vehicle scheduling problem (VSP) consists in assigning a set of scheduled trips to a set of vehicles in the public transportation, where the relation of every trip is not only cooperation but also competition. This paper analyzes two sorts of optimization models for vehicle scheduling problem in public transportation. The problems of minimizing vehicles' time headway for cooperation network and...
In OFDMA systems, reducing the inter-cell interference among adjacent cells is a very important issue especially for the cell-edge users. In this paper, we propose a distributed algorithm that maximizing the system total throughput considering proportional fairness. In our proposed algorithm, the frequency resources in each cell is divided into high and low power regions. The bandwidth allocations...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.