搜索结果: 1-15 共查到“理学 scheduling”相关记录29条 . 查询时间(0.732 秒)
Visual Analytics Approach to User-Controlled Transportation Scheduling
Transportation Scheduling Visual Analytics
2015/9/28
We consider the problem of scheduling the transportation of items of diverse categories from
multiple geographically distributed sources to multiple destinations, e.g. evacuation from a
disaster-a...
Convex optimization of output link scheduling and active queue management in QoS constrained packet switches
Algorithm switches generalized geometric programming convex optimization
2015/8/11
We present two novel algorithms at the ingress and egress of packet switches with QoS provisioning and fairness constraints. We first provide a suite of generalized weighted fair queuing formulations ...
MINIMUM LATENCY LINK SCHEDULING FOR ARBITRARY DIRECTED ACYCLIC NETWORKSUNDER PRECEDENCE AND SINR CONSTRAINTS
Minimum latency link scheduling SINR model physical interference model
2012/12/4
Scheduling wireless links under the SINR model has attracted increasing attention in the past few years [1–6, 8–15, 18–20, 23–25, 27, 28, 33–36, 39, 41, 42, 45, 46]. However, most of previous work did...
Minimum Latency Aggregation Scheduling for Arbitrary Tree Topologies under the SINR Model
Minimum Latency Tree undeer Topologies SINR Model
2012/12/4
Almost all the existing wireless data aggregation approaches；need a topology construction step before scheduling. These solutions assume the availability of flexible topology controls. However, in rea...
Exploiting Channel Correlation and PU Traffic Memory for Opportunistic Spectrum Scheduling
Cognitive radio networks spectrum server temporal correlation partially observable Markov decision processes genie-aided system
2012/4/23
We consider a cognitive radio network with multiple primary users (PUs) and one secondary user (SU), where a spectrum server is utilized for spectrum sensing and scheduling the SU to transmit over one...
Online over time scheduling on unbounded p-batch machines to minimize the makespan: A survey
operation sresearch online scheduling parallel-batch machines makespan competitive ratio
2011/11/14
Online scheduling is a rapidly developed branch in scheduling theory. In the research of online scheduling, makespan minimization on unbounded parallel-batch machines is a fruitful area. In this paper...
Single machine scheduling with processing time functions of starting time or position
operations research scheduling single machine processing time function time dependent
2011/11/14
In this paper, two single machine scheduling models with general processing time functions are considered. Job's processing time is assumed to be basic processing time adds a function of starting time...
Algorithm for Optimal Mode Scheduling in Switched Systems
Algorithm Optimal Mode Scheduling Switched Systems Systems and Control
2011/10/8
Abstract: This paper considers the problem of computing the schedule of modes in a switched dynamical system, that minimizes a cost functional defined on the trajectory of the system's continuous stat...
Stochastic Sensor Scheduling for Energy Constrained Estimation in Multi-Hop Wireless Sensor Networks
Wireless Sensor Networks Optimization State Estimation
2011/8/31
Abstract: Wireless Sensor Networks (WSNs) enable a wealth of new applications where remote estimation is essential. Individual sensors simultaneously sense a dynamic process and transmit measured info...
Distributed SIR-Aware Scheduling in Large-Scale Wireless Networks
Distributed SIR-Aware Large-Scale Wireless Networks Information Theory
2011/8/31
Abstract: Opportunistic scheduling and routing can in principle greatly increase the throughput of decentralized wireless networks, but to be practical they must do so with small amounts of timely sid...
Utility Optimal Scheduling in Energy Harvesting Networks
Utility Optimal Scheduling Energy Harvesting Networks
2011/1/19
In this paper, we show how to achieve close-tooptimal utility performance in energy harvesting networks with only finite capacity energy storage devices.
Network MIMO with Linear Zero-Forcing Beamforming: Large System Analysis, Impact of Channel Estimation and Reduced-Complexity Scheduling
Linear Zero-Forcing Beamforming Large System Analysis Impact of Channel Estimation Reduced-Complexity Scheduling
2011/2/21
We consider the downlink of a multi-cell system with multi-antenna base stations and single-antenna user terminals, arbitrary base station cooperation clusters, distance-dependent propagation pathloss...
Complexity of minimize total weighted average completion time scheduling problems with release times
flow-shop scheduling problem transportation delays
2010/9/20
The paper considers the problem of scheduling n jobs in a two-machine flow-shop to minimize the weighted sum of completion times. Between the completion of an operation and the beginning of the next o...
A mixed integer linear formulation for the open shop earliness-tardiness scheduling problem
Open shop scheduling Earliness/Tardiness criterion
2010/9/25
This paper addresses the problem of minimizing total earliness/tardiness penalty in an open shop scheduling environment with non-identical parallel machines. This problem is formulated as a mixed inte...
Stability of Random Admissible-Set Scheduling in Spatial Wireless Systems
Stability of Random Admissible-Set Spatial Wireless Systems
2011/2/21
We examine the stability of wireless networks whose users are distributed over a compact space. Users arrive at spatially uniform locations with intensity and each user has a random number of packet...