Optimizing block-based maintenance under random machine usage

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

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

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

منابع مشابه

Optimizing Database Algorithms for Random-Access Block Devices

Optimizing Database Algorithms for Random-Access Block Devices

متن کامل

Optimizing Maintenance of Constraint-Based Database Caches

Caching data reduces user-perceived latency and often enhances availability in case of server crashes or network failures. Database caching aims at local processing of specific declarative queries in a DBMSmanaged cache close to the application. Query evaluation must produce the same results as if done at the remote database backend, which implies that all data records needed to process such a ...

متن کامل

Stochastic Production Planning under Random Machine Breakdowns

In this paper, we consider a multi-period, multi-product production planning problem where the production rate and the customer service level are random variables due to machine breakdowns. In order to determine robust production plans, constraints are introduced in the stochastic capacitated lot-sizing problem to ensure that a prespecified customer service level is met with high probability. T...

متن کامل

Optimizing winter road maintenance operations under real-time information

0377-2217/$ see front matter 2008 Elsevier B.V. A doi:10.1016/j.ejor.2008.03.001 * Corresponding author. Tel.: +1 519 888 4567x339 E-mail addresses: [email protected] (L. Fu), vkim@ This paper introduces a real-time optimization model that can be used by maintenance managers to develop and evaluate alternative resources allocation plans for winter road maintenance operations. The model takes int...

متن کامل

Optimizing Random Patterns for Invariants-based Identification

This paper addresses the optimization of pseudo-random planar point patterns for invariant-based identi cation or indexing. This is a novel problem and is formulated here as the maximization of the spacing of all the invariants when considered as points in a space. The task is of formidable complexity and a stochastic approximation strategy is proposed that yields interesting results.

متن کامل

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


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

ژورنال

عنوان ژورنال: European Journal of Operational Research

سال: 2018

ISSN: 0377-2217

DOI: 10.1016/j.ejor.2017.07.051