Results 221 to 230 of about 2,827,333 (249)
Some of the next articles are maybe not open access.

On Optimal Scheduling

American Economic Journal: Microeconomics
We consider a decision-maker sequentially choosing among alternatives when periodic payoffs depend on both chosen and unchosen alternatives in that period. We show that when flow payoffs are the sum or product of payoffs from chosen and unchosen alternatives, the optimal policy is an index policy. We characterize key properties of the optimal dynamics
Kfir Eliaz   +2 more
openaire   +1 more source

Scheduling task graphs optimally with A*

The Journal of Supercomputing, 2010
Scheduling tasks onto the processors of a parallel system is a crucial part of program parallelisation. Due to the NP-hard nature of the task scheduling problem, scheduling algorithms are based on heuristics that try to produce good rather than optimal schedules. Nevertheless, in certain situations it is desirable to have optimal schedules, for example
Ahmed Zaki Semar Shahul, Oliver Sinnen
openaire   +2 more sources

Optimization Algorithm for Freight Car Transportation Scheduling Optimization Based on Process Scheduling Optimization

2018
Aiming at how to improve the efficiency of logistics transportation, taking into account the main constraints of road conditions and the number of commodity vehicles to be transported, proposed a path scheduling algorithm based on path functionalization. That is, the scheduling optimization of the path is regarded as a process scheduling.
Changchun Dong, Liang Zhou
openaire   +1 more source

Optimized Scheduling on Broadcast Disks

2001
Since the advent of wireless networks and portable computing devices, push-based data delivery has been discussed as an attractive communication framework for wireless environments. This paper focuses on the way of scheduling that leads to the minimum access delay for a hierarchical push-based data broadcast mechanism. This mechanism, called "Broadcast
Jeong-Hyon Hwang   +2 more
openaire   +1 more source

Towards Optimal Transaction Scheduling

Proceedings of the VLDB Endowment
Maximizing transaction throughput is key to high-performance database systems, which focus on minimizing data access conflicts to improve performance. However, finding efficient schedules that reduce conflicts remains an open problem. For efficiency, previous scheduling techniques consider only a small subset of possible schedules.
Audrey Cheng   +6 more
openaire   +1 more source

Biomimetic Optimizers for Job Scheduling

2012
In the paper, we proposed and tested a few biomimetic approaches for solving optimization problems derived from the practice of manufacturing. The main considered case is the cyclic flow shop scheduling problem with no-store constraints to minimize cycle time. Special problem properties are also shown.
openaire   +1 more source

Optimal Scheduling in Multiserver Queues

ACM SIGMETRICS Performance Evaluation Review
Scheduling theory is a key tool for reducing latency (i.e. response time) in queueing systems. Scheduling, i.e. choosing the order in which to serve jobs, can reduce response time by an order of magnitude with no additional resources. Scheduling theory is well-developed in single-server systems, where one job is processed at a time.
openaire   +1 more source

Optimal Scheduling for Charging and Discharging of Electric Vehicles

IEEE Transactions on Smart Grid, 2012
Bala Venkaṭesh, Ling Guan, Yifeng He
exaly  

Home - About - Disclaimer - Privacy