On Sample-Path Optimal Dynamic Scheduling for Sum-Queue Minimization in Forests

2014 ◽  
Vol 22 (1) ◽  
pp. 151-164 ◽  
Author(s):  
Srikanth Hariharan ◽  
Ness B. Shroff
Keyword(s):  
Dynamic Scheduling ◽  
Sample Path ◽  
Optimal Dynamic

Optimal Dynamic Scheduling of Aircraft Arrivals at Congested Airports

2008 ◽  
Vol 31 (1) ◽  
pp. 53-65 ◽  
Author(s):  
Aditya P. Saraf ◽  
Gary L. Slater
Keyword(s):  
Dynamic Scheduling ◽  
Optimal Dynamic

Optimal dynamic scheduling of a power generation system to satisfy multiple criteria

SIMULATION ◽  
1991 ◽  
Vol 56 (4) ◽  
pp. 241-249 ◽  
Author(s):  
Farshid Forouzbakhsh ◽  
Robert M. Deiters ◽  
Bahman S. Kermanshahi
Keyword(s):  
Power Generation ◽  
Dynamic Scheduling ◽  
Multiple Criteria ◽  
Generation System ◽  
Optimal Dynamic ◽  
Power Generation System

scholarly journals Optimal Dynamic Scheduling of Electric Vehicles in a Parking Lot Using Particle Swarm Optimization and Shuffled Frog Leaping Algorithm

Energies ◽  
2020 ◽  
Vol 13 (23) ◽  
pp. 6384
Author(s):  
George S. Fernandez ◽  
Vijayakumar Krishnasamy ◽  
Selvakumar Kuppusamy ◽  
Jagabar S. Ali ◽  
Ziad M. Ali ◽  
...  
Keyword(s):  
Particle Swarm Optimization ◽  
Electric Vehicles ◽  
Dynamic Scheduling ◽  
Particle Swarm ◽  
Optimization Techniques ◽  
Swarm Optimization ◽  
Scheduling Scheme ◽  
Parking Lot ◽  
Optimal Dynamic ◽  
Shuffled Frog Leaping

In this paper, the optimal dynamic scheduling of electric vehicles (EVs) in a parking lot (PL) is proposed to minimize the charging cost. In static scheduling, the PL operator can make the optimal scheduling if the demand, arrival, and departure time of EVs are known well in advance. If not, a static charging scheme is not feasible. Therefore, dynamic charging is preferred. A dynamic scheduling scheme means the EVs may come and go at any time, i.e., EVs’ arrival is dynamic in nature. The EVs may come to the PL with prior appointments or not. Therefore, a PL operator requires a mechanism to charge the EVs that arrive with or without reservation, and the demand for EVs is unknown to the PL operator. In general, the PL uses the first-in-first serve (FIFS) method for charging the EVs. The well-known optimization techniques such as particle swarm optimization and shuffled frog leaping algorithms are used for the EVs’ dynamic scheduling scheme to minimize the grid’s charging cost. Moreover, a microgrid is also considered to reduce the charging cost further. The results obtained show the effectiveness of the proposed solution methods.

Optimal dynamic scheduling of a general class of parallel-processing queueing systems

1998 ◽  
Vol 30 (04) ◽  
pp. 1130-1156 ◽  
Author(s):  
Noah Gans ◽  
Garrett van Ryzin
Keyword(s):  
Parallel Processing ◽  
Closed Form ◽  
General Class ◽  
Dynamic Scheduling ◽  
Broad Class ◽  
Heavy Traffic ◽  
Queueing Systems ◽  
Optimal System ◽  
Call System ◽  
Optimal Dynamic

In this paper we develop policies for scheduling dynamically arriving jobs to a broad class of parallel-processing queueing systems. We show that in heavy traffic the policies asymptotically minimize a measure of the expected system backlog, which we call system work. Our results yield succinct, closed-form expressions for optimal system work in heavy traffic.

Sign in / Sign up

Export Citation Format

Share Document