As an emerging and promising technology, Time Sensitive Networking (TSN) can be widely used in many real-time systems such as Industrial Internet of Things (IIoT) and Cyber Physical System (CPS). TSN, while ens
Fattah H., Leung C. (2002) An overview of scheduling algorithms in wireless multimedia networks. IEEE Wireless Communications Magazine 9: 76–83 Article Google Scholar Anpalagan A., Sousa E. (2004) A distributed packet scheduling scheme with interference avoidance for non-real time applications ...
We study the performance of these algorithms in settings where either battery swap or battery charge at each station is used to cope with the EVs' limited driving range. Moreover, in settings where EVs need to be scheduled online, we propose a novel algorithm that accounts for the uncertainty...
6.19 Which of the following scheduling algorithms could result in starvation? 以下哪种调度算法可能导致饥饿? [ ] a. First-come, first-served [x] b. Shortest job first [ ] c. Round robin [x] d. Priority Answer: Shortest job first and priority-based scheduling algorithms could result in sta...
Realizing the significance of the airline crew scheduling problems and a lack of review on the modelling and algorithmic advancements in terms of each crew type and planning stage, we develop this paper to review the related literature from four aspects: the scheduling for cabin crew, the ...
We found that significant performance improvement, in terms of average packet delay, data user capacity and coverage, could be achieved by our scheme compared to the existing burst assignment algorithms. 展开 关键词: Code division multiple access High data rate Admission control Burst data ...
In the era of Industry 4.0, order scheduling is a crucial link in the production of manufacturing enterprises. In view of order scheduling in manufacturing enterprises, a finite horizon Markov decision process model is proposed in this work based on two
The optimal scheduling problem of integrated energy system (IES) has the characteristics of high-dimensional nonlinearity. Using the traditional Grey Wolf Optimizer (GWO) to solve the problem, it is easy to fall into a local optimum in the process of opt
Cloud computing Resource allocation Pareto solutions Bacteria foraging Genetic algorithms 1. Introduction With the ubiquitous growth of Internet access and big data in their volume, velocity, and variety through the Internet, cloud computing becomes more and more proliferating in the industry, academia, ...
The competitive ratio of A is the smallest c for which A is c-competitive. For the online version of temperature-aware scheduling, we show a 2-competitive deterministic algorithm and a matching lower bound. In fact, we will show that a wide class of online algorithms is 2-competitive. ...