衰落和部分信道信息下的调度

Electric Vehicle Scheduling with Capacitated Charging Stations and Partial Charging

This paper considers the scheduling of electric vehicles in a public transit system. Our main innovation is that we take into account that charging stations have limited capacity, while also considering partial charging. To solve the problem, we expand a connection-based network in order to track the state of charge of vehicles and model recharging actions. We then formulate the electric vehicle scheduling problem as a path-based binary program, whose linear relaxation we solve using column generation. We find integer feasible solutions using two heuristics: price-and-branch and truncated colu…

Dynamic scheduling in a partially fluid, partially lossy queueing system

We consider a single server queueing system with two classes of jobs: eager jobs with small sizes that require service to begin almost immediately upon arrival, and tolerant jobs with larger sizes that can wait for service. While blocking probability is the relevant performance metric for the eager class, the tolerant class seeks to minimize its mean sojourn time. In this paper, we discuss the performance of each class under dynamic scheduling policies, where the scheduling of both classes depends on the instantaneous state of the system. This analysis is carried out under a certain fluid limi…

Post-disaster Repair Scheduling in Partially Automated Electricity Distribution Networks

Natural disasters require repairing all damaged components in electricity distribution networks. Optimal scheduling repair crews to minimize the aggregate duration of interruptions reduces the harm. We consider the fact that the number of switches is much smaller than the number of edges. The problem is modeled by a parallel identical machine scheduling with group soft precedence constraints to minimize the total weighted energization time. We propose an LP-based list scheduling algorithm and a conversion algorithm and analyze their theoretical performances.

以偏序宽度为参数的优先约束排序问题

Precedence-constrained scheduling problems parameterized by partial order width

否定地回答Mnich和Wiese提出的一个问题（数学程序。154（1-2）：533-562），我们表明，P2| prec，$p_j{\in}\{1,2\}$| $C_{\max}$是在两台平行的相同机器上为长度为1和2的工件寻找一个非抢占式最小完工时间调度的问题，该问题是W[2]-难参数化的.为此，我们证明了Shuffle Product，即决定是否可以通过交织$k$其他给定单词的字母来获得给定单词的问题，是由$k$参数化的W[2]-hard，从而另外回答了Rizzi和Vialette提出的问题（CSR 2013）。最后，由于Servakh（Serretn. Anal.伊斯利Oper 7（1）：75-82），我们证明了更一般的资源约束项目调度问题是固定参数的易处理问题，它由偏序宽度和工件最早可能开始时间与实际开始时间之间的最大允许差参数化。

远程状态估计中隐藏信道模式下的结构单调性

Structural Monotonicity in Transmission Scheduling for Remote State Estimation with Hidden Channel Mode

本文研究了在不可靠信道中利用隐藏模式的远程状态估计传输调度问题，通过部分可观测马尔可夫决策过程建模，提出状态空间折叠技术以恢复顺序保持性，从而实现单调性分析，并展示最优调度策略具有阈值结构。

Optimal Scheduling and Exact Response Time Analysis for Multistage Jobs

Scheduling to minimize mean response time in an M/G/1 queue is a classic problem. The problem is usually addressed in one of two scenarios. In the perfect-information scenario, the scheduler knows each job's exact size, or service requirement. In the zero-information scenario, the scheduler knows only each job's size distribution. The well-known shortest remaining processing time (SRPT) policy is optimal in the perfect-information scenario, and the more complex Gittins policy is optimal in the zero-information scenario. In real systems the scheduler often has partial but incomplete information…

块衰落中继辅助广播信道的联合功率和资源分配

Joint Power and Resource Allocation for Block-Fading Relay-Assisted Broadcast Channels

我们提供的解决方案，优化功率和资源分配块衰落中继辅助广播信道，以最大化的长期平均可达速率区域的用户。问题公式假设再生（重复编码）解码和转发（DF）中继策略，长期平均总发射功率约束，信道块内的用户消息的正交复用，使用直接传输（DT）模式从基站到用户终端直接或中继（DF）传输模式的可能性，和部分信道状态信息。我们表明，我们的优化问题可以转化为一个等效的“无中继”广播信道优化问题，每个实际用户由两个虚拟用户具有不同的信道质量和复用权重。建议的功率和资源分配策略表示在封闭的形式，可以实际应用于集中式中继辅助无线网络。此外，我们通过数值例子表明，我们的计划扩大了可实现的速率区域显着。