Adaptive modulation for completion time minimization in wireless broadcast networks

2017 ◽  
Vol 72 ◽  
pp. 72-78 ◽  
Author(s):  
Melda Yuksel ◽  
Yasin Genç
Keyword(s):  
Completion Time ◽  
Adaptive Modulation ◽  
Wireless Broadcast ◽  
Broadcast Networks ◽  
Time Minimization

Scheduling Jobs with Truncated Exponential Sum-of-Logarithm-Processing-Times Based and Position-based Learning Effects

2015 ◽  
Vol 32 (04) ◽  
pp. 1550026 ◽  
Author(s):  
Yuan-Yuan Lu ◽  
Fei Teng ◽  
Zhi-Xin Feng
Keyword(s):  
Single Machine ◽  
Minimization Problem ◽  
Completion Time ◽  
Heuristic Algorithms ◽  
Exponential Sum ◽  
Total Weighted Completion Time ◽  
Learning Effects ◽  
Processing Times ◽  
Time Minimization ◽  
Weighted Completion Time

In this study, we consider a scheduling problem with truncated exponential sum-of-logarithm-processing-times based and position-based learning effects on a single machine. We prove that the shortest processing time (SPT) rule is optimal for the makespan minimization problem, the sum of the θth power of job completion times minimization problem, and the total lateness minimization problem, respectively. For the total weighted completion time minimization problem, the discounted total weighted completion time minimization problem, the maximum lateness minimization problem, we present heuristic algorithms (the worst-case bound of these heuristic algorithms are also given) according to the corresponding single machine scheduling problems without learning considerations. It also shows that the problems of minimizing the total tardiness, the total weighted completion time and the discounted total weighted completion time are polynomially solvable under some agreeable conditions on the problem parameters.

scholarly journals Efficient Online Scheduling of Electric Vehicle Charging Using a Service-Price Menu

2021 ◽  
Author(s):  
Angeliki Mathioudaki ◽  
Georgios Tsaousoglou ◽  
Emmanouel varvarigos ◽  
Dimitris Fotakis
Keyword(s):  
Quality Of Service ◽  
Electric Vehicles ◽  
Completion Time ◽  
Online Algorithm ◽  
Charging Station ◽  
Electric Vehicle Charging ◽  
Guaranteed Quality ◽  
Time Minimization ◽  
Weighted Completion Time

We present an online algorithm for scheduling the charging of Electric Vehicles (EVs) in a Charging Station, aiming to optimize the overall quality of service through sum of weighted completion time minimization. Upon arrival of each EV, the algorithm generates a menu of service-price options. By letting the EV users pick their most preferable option, the algorithm offers guaranteed quality of service, achieves near optimal performance, and prevents the users from acting strategically.

scholarly journals Scheduling to Minimize Age of Synchronization in Wireless Broadcast Networks With Random Updates

2020 ◽  
Vol 19 (6) ◽  
pp. 4023-4037 ◽  
Author(s):  
Haoyue Tang ◽  
Jintao Wang ◽  
Zihan Tang ◽  
Jian Song
Keyword(s):  
Wireless Broadcast ◽  
Broadcast Networks

Semantic-Based Access to Composite Mobile Services

2011 ◽  
Vol 8 (3) ◽  
pp. 70-100 ◽  
Author(s):  
Xu Yang ◽  
Athman Bouguettaya ◽  
Xumin Liu
Keyword(s):  
Experimental Study ◽  
Mobile Services ◽  
Analytical Models ◽  
Mobile Users ◽  
Access Methods ◽  
Wireless Broadcast ◽  
Broadcast Networks

In this paper, the authors propose novel access methods and a multi-channel organization for mobile users to effectively access composite M-services in wireless broadcast networks. The authors first propose a broadcast-based infrastructure to address the challenges of efficient usages of composite M-services. They then define a few semantics for accessing broadcast based M-services and discuss the strategies of efficiently accessing M-services based on the semantics. The authors also propose several channel organization that are suitable for the broadcast-based M-service structure and provide analytical models for them. They conduct a comprehensive experimental study on the proposed access methods.

Sign in / Sign up

Export Citation Format

Share Document