Results 241 to 250 of about 5,548,935 (303)
Some of the next articles are maybe not open access.
On the optimality of linear schedules
Journal of VLSI signal processing systems for signal, image and video technology, 1989An algorithm can be modeled as a set of indexed computations, and a schedule is a mapping of the algorithm index space into time.Linear schedules are a special class of schedules that are described by a linear mapping and are commonly used in many systolic algorithms.Free schedules cause computations of an algorithm to execute as soon as their operands
Weijia Shang, José A. B. Fortes
openaire +1 more source
Joint Optimal Scheduling for a Mixed Bus Fleet Under Micro Driving Conditions
IEEE transactions on intelligent transportation systems (Print), 2021The emergence of electric buses (EBs) is expected to alleviate traffic pollution. However, the promotion of EBs requires a long transition period; during this period, EBs cannot wholly replace conventional buses (CBs). In addition, compared with CBs, EBs
Tianwei Lu +3 more
semanticscholar +1 more source
[1993] Proceedings IEEE International Conference on Robotics and Automation, 2002
The local optimality (LO) property for discrete event dynamic systems (DEDS) modeled using Petri nets (PNs) is presented. If a system is divided into independent subsystems and if the optimal behavior of these subsystems guarantees the optimal behavior of the whole system, then this system possesses the LO property.
Antonio Ramírez-Treviño +2 more
openaire +1 more source
The local optimality (LO) property for discrete event dynamic systems (DEDS) modeled using Petri nets (PNs) is presented. If a system is divided into independent subsystems and if the optimal behavior of these subsystems guarantees the optimal behavior of the whole system, then this system possesses the LO property.
Antonio Ramírez-Treviño +2 more
openaire +1 more source
On strictly optimal schedules for the cumulative cost-optimal scheduling problem
Computing, 1980Given a set ofn events (or jobs) which are constrained by a precedence relation, we want to order them into a totally ordered sequence (i. e., one machine schedule). Each event has an integer cost (which may be negative) associated with it, and our objective is to minimize the maximum cumulative cost within a schedule, i.
Hussein M. Abdel-Wahab, Tiko Kameda
openaire +1 more source
Asymptotically Optimal Appointment Schedules
Mathematics of Operations Research, 2019We consider the problem of scheduling appointments for a finite customer population to a service facility with customer no-shows to minimize the sum of customer waiting time and server overtime costs. Because appointments need to be scheduled ahead of time, we refer to this problem as an optimization problem rather than a dynamic control one. We study
Mor Armony, Rami Atar, Harsha Honnappa
openaire +2 more sources
Energy, 2020
This paper presents a two-stage stochastic programming model for optimal scheduling of the wind-thermal-hydropower-pumped storage system considering the competitive interactions between the electrical generation units.
M. Daneshvar +3 more
semanticscholar +1 more source
This paper presents a two-stage stochastic programming model for optimal scheduling of the wind-thermal-hydropower-pumped storage system considering the competitive interactions between the electrical generation units.
M. Daneshvar +3 more
semanticscholar +1 more source
Optimal scheduling of thermal-wind-solar power system with storage
Renewable Energy, 2017Surender Reddy Salkuti
exaly +2 more sources
Optimal Fault-Secure Scheduling
The Computer Journal, 1998Summary: We consider here two basic fault-secure scheduling problems for multiprocessor systems. First, given the number of processors in the system and a set of computational tasks of unit length expressed as a complete binary tree, a scheduling algorithm is proposed such that the total execution time is a minimum and no undetected single error result
Jie Wu 0001 +2 more
openaire +1 more source
IEEE Transactions on Smart Grid
This paper proposes an augmented Lagrangian-based safe off-policy deep reinforcement learning (DRL) algorithm for the carbon-oriented optimal scheduling of electric vehicle (EV) aggregators in a distribution network.
Xiaoying Shi +3 more
semanticscholar +1 more source
This paper proposes an augmented Lagrangian-based safe off-policy deep reinforcement learning (DRL) algorithm for the carbon-oriented optimal scheduling of electric vehicle (EV) aggregators in a distribution network.
Xiaoying Shi +3 more
semanticscholar +1 more source
, 2020
The extension of battery life in electric bus fleets depends intimately on the effective energy management of both internal controls on board and external operations on roads.
Jing Wang, L. Kang, Yongzhong Liu
semanticscholar +1 more source
The extension of battery life in electric bus fleets depends intimately on the effective energy management of both internal controls on board and external operations on roads.
Jing Wang, L. Kang, Yongzhong Liu
semanticscholar +1 more source

