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.
Rail high-speed passenger lines (HSPL) have been developed rapidly in China; however, the traditional rail crew scheduling mode called responsible mode, in which crews are bundled with vehicles, is hard to adapt to the transit characteristic of HSPL. Moreover, the utilization of rail crew resources is commonly inefficient and the scheduling methods are generally behindhand. To reduce the pressure...
A novel approach for short-term hydrothermal power systems with cascaded reservoirs using cultural algorithm (CA) is presented in this paper. The large scale hydrothermal scheduling involves optimization of a non-linear objective function with a set of system and hydraulic constraints. The approach takes the water transport delay time between connected reservoirs and complicated hydraulic coupling...
Study on production optimization and scheduling has always been the focus of attention and research by the scholars in manufacturing industry. After analyzing research achievements in manufacturing production informatization of several scholars at home and abroad, this paper regards the production schedule arrangements of small and medium-sized automobile parts enterprises as research object and uses...
As the complexity of under the condition of large-scaled resource-constrained multi-project duration optimization problems, it is difficult to give its analysis solution. With the network technology in this paper, taking the minimum number of the multi-project weighted duration as the goal, then establish a mathematical model for the optimization problem. In view of the basic cellular automaton topological...
The process planning and scheduling (PPS) is to determine a solution (schedule), which tells a production facility what to make, when, and on which equipment, to process a set of parts with operations effectively. Multiobjective PPS problems become more complex because the decision maker need to make a trade-off between two or more objectives while determining a set of optimal nondominated solutions...
Stochastic search algorithms are often robust, scalable problem solvers. In this paper, we carefully study the Iterative Sampling(IS), Heuristic-Biased Stochastic Sampling(HBSS) and Value-Biased Stochastic Sampling(VBSS) algorithm, and present an approach for enhancing such multi-start algorithms. This paper shows that given some heuristic information about the search start point, these algorithms...
Scientific task allocation and knowledge workers scheduling is an important part of rational human resources management in enterprises. In this paper, ant colony algorithm is used to research task allocation and knowledge workers scheduling. Ant colony optimization algorithm can reduce the number of optimization iteration and computing time. Elite solution retention tactics is used in iterating process...
In this work we consider the allocation of buffer space to data streams sharing a common high-speed wireless transmitter. As an example, we focus on an OFDMA-based downlink system scenario. Scheduling for maximum throughput has been extensively studied in the literature. However, the practically interesting case of a finite buffer has not been sufficiently addressed before. Especially in the case...
This paper addresses the problem of the coordination of the day-ahead scheduling with a stochastic weekly unit commitment for the efficient scheduling of slow-start thermal units. The solution of the 24-hour unit commitment may lead to cases, in which slow-start thermal units that are initially offline cannot be scheduled efficiently, due to their long start-up and minimum-up times as well as their...
Grid is evolving to a more efficient global computing infrastructure by introducing more and more task scheduling algorithms. With the grid expansion and users' requirements in an intuitive way, a new robust multi-criteria scheduling algorithm is needed. Resource brokers should provide a more comprehensive solution for users. Multiple scheduling criteria addressed by the related grid research include...
At present, power management in High-Performance Computing (HPC) environment is becoming a hot topic owning to its high operation cost, low reliability and environmental impact. In this paper, we investigate energy minimization scheduling algorithm of data dependent tasks in DVS-Enabled cluster system. Considering the data-intensive characteristics, the proposed EOTD (Energy Optimization scheduling...
For many control systems, control performance is strongly dependent on delay variations of the control tasks. Such variations can come from a number of sources including task preemptions, variations in task workloads and perturbations in the physical environment. Existing work has considered improving control task delay variations due to task preemption only. This paper presents a general adaptive...
In the design of time-critical applications, schedulability analysis can be used to define the feasibility region of tasks so that optimization techniques can find the best design solution that satisfies the deadlines. This method has been applied to obtain the optimal task implementation, priority assignment or placement of tasks onto CPUs in previous work. The definition of the feasibility region...
The emerging computational grid infrastructure consists of heterogeneous resources in widely distributed autonomous domains, which makes job scheduling very challenging. Although there is much work on static scheduling approaches for workflow applications in parallel environments, little work has been done on a real-world Grid environment for industrial systems. Utility Management Systems (UMS) are...
Optimization problem of flight sequencing on the ground of airport with multi-taxiway and multi-runway is resolved based on gene expression algorithm, and a standard algorithm of aircraft approach sequencing for airports with any topology structure in theory is approved. Based on an actual airport ground operation situation, a standard algorithm for the two runways of this airport is provided. Compared...
Optimal assigning jobs to resources is an important problem in grid computing. Now grid scheduling policies are mostly traditional heuristic algorithms for scheduling n independent tasks on m processors in early finishing time. However grids have developed to wide area, heterogeneous and non autonomous environments, business objective also became crucial for the success of the scheduling. Therefore...
Providing guaranteed quality-of-service (QoS) for resource-hungry multimedia applications over wireless fading channels is challenging. Traditional layered architecture fails miserably in providing the QoS requirement of high throughput, low latency demand of these kinds of applications in wireless mobile networks. Cross-layer design approaches are critical for efficient utilization of the scarce...
Multi-core architecture provides more on-chip parallelism and powerful computational capability. It helps virtualization achieve scalable performance. KVM (kernel based virtual machine) is different from other virtualization solutions which can make use of the Linux kernel components such as completely fair scheduler (CFS). However, CFS treats the KVM threads as normal tasks without considering about...
Distributed Web crawling (DWC) over DHTs is proposed to solve the bottlenecks in the traditional Web crawling. The core of this kind of system is its fully distributed task scheduling mechanism in which the crawlers are treated as peers and the crawlees are treated as resources maintained by the peers. A system model based on the content addressable network (CAN) can further optimize the scheduling...
Hundreds of papers over the last two decades have studied the theory of distributed scheduling in wireless networks, including a number of them on stability or utility maximizing random access. Several publications in 2008 studied an adaptive CSMA that in theory can approach utility optimality without any message passing under a number of assumptions. This paper reports the results from the first...
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.