A General State-Space Formulation for Online Scheduling

نویسندگان

  • Dhruv Gupta
  • Christos T. Maravelias
چکیده

We present a generalized state-space model formulation particularly motivated by an 1 online scheduling perspective. Through these proposed generalizations, we enable a natural way 2 to handle routinely encountered disturbances and a rich set of corresponding counter-decisions. 3 Thereby, greatly simplifying and extending the possible application of mathematical programming 4 based online scheduling solutions to diverse application settings. 5

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust Fixed-order Gain-scheduling Autopilot Design using State-space Stability-Preserving Interpolation

In this paper, a robust autopilot is proposed using stable interpolation based on Youla parameterization. The most important condition of stable interpolation between local controllers is the preservation of stability so that each local controller can ensure stability for an open neighborhood around a nominal point. The proposed design used fixed-order robust controller with parameter-dependent...

متن کامل

Online State Space Model Parameter Estimation in Synchronous Machines

The purpose of this paper is to present a new approach based on the Least Squares Error method for estimating the unknown parameters of the nonlinear 3rd order synchronous generator model. The proposed method uses the mathematical relationships between the machine parameters and on-line input/output measurements to estimate the parameters of the nonlinear state space model. The field voltage is...

متن کامل

A Kernel-based Approach to MIMO LPV State-space Identification and Application to a Nonlinear Process System ?

This paper first describes the development of a nonparametric identification method for linear parameter-varying (LPV) state-space models and then applies it to a nonlinear process system. The proposed method uses kernel-based least-squares support vector machines (LS-SVM). While parametric identification methods require proper selection of basis functions in order to avoid overparametrization ...

متن کامل

A dynamic programming approach for solving nonlinear knapsack problems

Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...

متن کامل

Online Scheduling of Jobs for D-benevolent instances On Identical Machines

We consider online scheduling of jobs with specic release time on m identical machines. Each job has a weight and a size; the goal is maximizing total weight of completed jobs. At release time of a job it must immediately be scheduled on a machine or it will be rejected. It is also allowed during execution of a job to preempt it; however, it will be lost and only weight of completed jobs contri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017