中文
相关论文

相关论文: Complex-demand Scheduling Problem with Application…

200 篇论文

This paper proposes a hybrid approach to optimal day-ahead pricing for demand response management. At the customer-side, compared with the existing work, a detailed, comprehensive and complete energy management system, which includes all…

系统与控制 · 计算机科学 2015-10-29 Fan-Lin Meng , Xiao-Jun Zeng

We study real-time routing policies in smart transit systems, where the platform has a combination of cars and high-capacity vehicles (e.g., buses or shuttles) and seeks to serve a set of incoming trip requests. The platform can use its…

最优化与控制 · 数学 2021-03-22 Siddhartha Banerjee , Chamsi Hssaine , Noémie Périvier , Samitha Samaranayake

In modern smart grids, charging of local energy storage devices is coordinated on a residential level to compensate the volatile aggregated power demand on the time interval of interest. However, this results in a perpetual usage of all…

系统与控制 · 电气工程与系统科学 2020-02-11 Philipp Sauerteig , Yuning Jiang , Boris Houska , Karl Worthmann

Selecting customers for demand response programs is challenging and existing methodologies are hard to scale and poor in performance. The existing methods were limited by lack of temporal consumption information at the individual customer…

应用统计 · 统计学 2014-09-16 Jungsuk Kwac , Ram Rajagopal

We investigate the problem of serving deferrable and nondeferrable electric demands with colocated stochastic supply and grid-imported electricity. Deferrable demands arrive randomly and can be delayed within their service deadlines.…

系统与控制 · 电气工程与系统科学 2026-05-05 Minjae Jeon , Lang Tong , Qing Zhao

The Grid technology is evolving into a global, service-orientated architecture, a universal platform for delivering future high demand computational services. Strong adoption of the Grid and the utility computing concept is leading to an…

分布式、并行与集群计算 · 计算机科学 2007-11-05 Aleksandar Lazarevic , Lionel Sacks , Ognjen Prnjat

We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of rounding techniques yield novel and powerful ways of rounding.…

计算复杂性 · 计算机科学 2007-05-23 Monaldo Mastrolilli , Marcus Hutter

Motivated by cloud computing applications, we study the problem of how to optimally deploy new hardware subject to both power and robustness constraints. To model the situation observed in large-scale data centers, we introduce the Online…

数据结构与算法 · 计算机科学 2022-09-05 Konstantina Mellou , Marco Molinaro , Rudy Zhou

We consider "time-of-use" pricing as a technique for matching supply and demand of temporal resources with the goal of maximizing social welfare. Relevant examples include energy, computing resources on a cloud computing platform, and…

计算机科学与博弈论 · 计算机科学 2017-04-11 Shuchi Chawla , Nikhil R. Devanur , Alexander E. Holroyd , Anna Karlin , James Martin , Balasubramanian Sivan

This paper studies the scheduling of a large population of non-preemptive flexible electric loads, each of which has a flexible starting time but once started will follow a fixed load shape until completion. We first formulate the…

最优化与控制 · 数学 2025-03-10 Mehdi Davoudi , Mingyu Chen , Junjie Qin

In this paper we consider single machine scheduling problems with additional non-renewable resource constraints. Examples for non-renewable resources include raw materials, energy, or money. Usually they have an initial stock and…

最优化与控制 · 数学 2020-04-03 Péter Györgyi , Tamás Kis

Real-time end-to-end task scheduling in networked control systems (NCSs) requires the joint consideration of both network and computing resources to guarantee the desired quality of service (QoS). This paper introduces a new model for…

网络与互联网体系结构 · 计算机科学 2022-10-21 Peng Wu , Chenchen Fu , Tianyu Wang , Minming Li , Yingchao Zhao , Chun Jason Xue , Song Han

In this paper, a mixed integer linear formulation for problems considering time-of-use-type constraints for uninterruptible services is presented. Our work is motivated by demand response problems in power systems, in which certain devices…

最优化与控制 · 数学 2020-10-16 Ana Batista , David Pozo , Jorge Vera

In this paper, a framework is proposed to simplify solving the infinite horizon average cost problem for the weakly coupled multi-dimensional systems. Specifically, to address the computational complexity issue, we first introduce a virtual…

信息论 · 计算机科学 2016-06-27 Fan Zhang , Ying Cui , Vincent K. N. Lau , An Liu

In this paper we consider the coupled task scheduling problem with exact delay times on a single machine with the objective of minimizing the total completion time of the jobs. We provide constant-factor approximation algorithms for several…

最优化与控制 · 数学 2024-05-03 David Fischer , Péter Györgyi

We study distributed convex constrained optimization on a time-varying multi-agent network. Each agent has access to its own local cost function, its local constraints, and its instant number of out-neighbors. The collective goal is to…

信号处理 · 电气工程与系统科学 2019-05-28 Tatiana Tatarenko , Jan Zimmermann , Volker Willert andJürgen Adamy

This paper considers a time-varying optimization problem associated with a network of systems, with each of the systems shared by (and affecting) a number of individuals. The objective is to minimize cost functions associated with the…

最优化与控制 · 数学 2022-03-15 Ana M. Ospina , Andrea Simonetto , Emiliano Dall'Anese

Loads that can vary their power consumption without violating their Quality of service (QoS), that is flexible loads, are an invaluable resource for grid operators. Utilizing flexible loads as a resource requires the grid operator to…

系统与控制 · 电气工程与系统科学 2020-06-30 Austin R. Coffman , Matthew Hale , Prabir Barooah

We consider the product knapsack problem, which is the variant of the classical 0-1 knapsack problem where the objective consists of maximizing the product of the profits of the selected items. These profits are allowed to be positive or…

最优化与控制 · 数学 2021-06-29 Ulrich Pferschy , Joachim Schauer , Clemens Thielen

We consider the classical scheduling problem on parallel identical machines to minimize the makespan, and achieve the following results under the Exponential Time Hypothesis (ETH) 1. The scheduling problem on a constant number $m$ of…

计算复杂性 · 计算机科学 2013-10-02 Lin Chen , Klaus Jansen , Guochuan Zhang