Space Pruning Based Time Minimization in Delay Constrained Multi-Task UAV-Based Sensing

2021 ◽  
Vol 70 (3) ◽  
pp. 2836-2849 ◽  
Author(s):  
Kaitao Meng ◽  
Deshi Li ◽  
Xiaofan He ◽  
Mingliu Liu
Keyword(s):  
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 Test Time Minimization for Hybrid BIST of Core-Based Systems

2006 ◽  
Vol 21 (6) ◽  
pp. 907-912 ◽  
Author(s):  
Gert Jervan ◽  
Petru Eles ◽  
Zebo Peng ◽  
Raimund Ubar ◽  
Maksim Jenihhin
Keyword(s):  
Test Time ◽  
Time Minimization

scholarly journals A Zermelo navigation problem with a vortex singularity

2020 ◽  
Author(s):  
Boris Edgar Moafo Wembe ◽  
Olivier Cots ◽  
Bernard Bonnard
Keyword(s):  
Rotational Symmetry ◽  
Initial Point ◽  
Hamiltonian Vector Field ◽  
Weak Current ◽  
Navigation Problem ◽  
Strong Current ◽  
Time Minimization ◽  
Current Region ◽  
Randers Metrics

Helhmoltz-Kirchhoff equations of motions of vortices of an incompressible fluid in the plane define a dynamics with singularities and this leads to a Zermelo navigation problem describing the ship travel in such a field where the control is the heading angle. Considering one vortex, we define a time minimization problem, geometric frame being the extension of Randers metrics in the punctured plane, with rotational symmetry. Candidates as minimizers are parameterized thanks to the Pontryagin Maximum Principle as extremal solutions of a Hamiltonian vector field. We analyze the time minimal solution to transfer the ship between two points where during the transfer the ship can be either in a strong current region in the vicinity of the vortex or in a weak current region. Analysis is based on a micro-local classification of the extremals using mainly the integrability properties of the dynamics due to the rotational symmetry. The discussion is complex and related to the existence of an isolated extremal (Reeb) circle due to the vortex singularity. Explicit computation of cut points where the extremal curves cease to be optimal is given and the spheres are described in the case where at the initial point the current is weak.

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.

Sign in / Sign up

Export Citation Format

Share Document