We formulate a fairly general deterministic problem of scheduling electric vehicle (EV) regular charging tasks on parallel chargers over time. Charging task is called regular if it is performed at the same time and in the same place. The charging time and place can be fixed or selectable The scheduling decision time range can be an interval or a circle. Charging tasks may or may not be preemptive. Each charging preemption may imply a setup time and a cost. Each task requires a given amount of energy to be received from the chargers. This energy determines the charging time requirement. The chargers consume electric power which can be limited from above. The objective is to minimize the cost of the chargers and their locations, received energy, maximum power and setups, or a function of task completion times. The problem is typical for urban electric buses with fixed timetables and charging points at depots or along the route. It can also be a part of a more general EV routing and charging scheduling problem, which is often decomposed into the routing and charging scheduling parts in order to reduce computational complexity. Various special cases of this problem have been studied in the literature, in the theoretical and practical contexts. We review and analyze these special cases using traditional scheduling terminology, thereby creating a bridge between theoretical machine scheduling and practical charging scheduling research.

中文翻译：

---

安排电动汽车定期充电任务：确定性模型综述


我们制定了一个相当普遍的确定性问题，即随着时间的推移在并联充电器上安排电动汽车 （EV） 的定期充电任务。如果充电任务在同一时间、同一地点执行，则称为 regular。充电时间和地点可以是固定的，也可以选择调度决策时间范围可以是间隔或圆圈。充电任务可能是抢占式的，也可能不是。每次充电抢占可能意味着设置时间和成本。每项任务都需要从充电器接收一定量的能量。该能量决定了充电时间要求。充电器消耗电力，可以从上方限制。目标是最大限度地降低充电器及其位置、接收能量、最大功率和设置或任务完成时间的函数的成本。这个问题对于具有固定时刻表和在停车场或沿途充电点的城市电动公交车来说是典型的。它也可以是更通用的 EV 路线和充电调度问题的一部分，该问题通常被分解为路线和充电调度部分，以降低计算复杂性。这个问题的各种特殊情况已经在文献、理论和实践背景下进行了研究。我们使用传统的调度术语对这些特殊情况进行回顾和分析，从而在理论机器调度和实际充电调度研究之间架起一座桥梁。