Optimal Fixed Batch Sizes for Real-Time Inquiry Systems
نویسندگان
چکیده
منابع مشابه
Newsboy Characterizations for the Optimal Reorder Levels of Multi-Echelon Inventory Systems with Fixed Batch Sizes
This note considers an N -stage serial production/inventory system where materials flow from one stage to another in fixed batches. Linear holding and penalty costs (for backorders) are assumed. By Chen [2000], echelon stock (R,nQ) policies are optimal for such systems. Based on the results of Chen [1998], we show that the optimal reorder levels satisfy newsboy inequalities (equalities) when th...
متن کاملReal time scheduling of batch systems
The approach presented in this article is based on the real time simulation of p-time Petri net for the real time scheduling of batch systems. After defining the different kinds of constraints which can exist in a linear hybrid production system, we present the conflict resolution principle used by a token player algorithm at the global coordination level.
متن کاملModel approximation for batch flow shop scheduling with fixed batch sizes
Batch flow shops model systems that process a variety of job types using a fixed infrastructure. This model has applications in several areas including chemical manufacturing, building construction, and assembly lines. Since the throughput of such systems depends, often strongly, on the sequence in which they produce various products, scheduling these systems becomes a problem with very practic...
متن کاملTime-optimal batch diafiltration
This study concentrates on time-optimal operation of a general batch diafiltration process. The process model consists of a set of input affine differential equations. We apply Pontryagin’s minimum principle to formulate necessary conditions of optimality. These are then used to identify the shape of optimal control as well as singular surface in concentration space. Comparison is made between ...
متن کاملAnalyzing Stochastic Fixed-Priority Real-Time Systems
Traditionally, real-time systems require that the deadlines of all jobs be met. For many applications, however, this is an overly stringent requirement. An occasional missed deadline may cause decreased performance but is nevertheless acceptable. We present an analysis technique by which a lower bound on the percentage of deadlines that a periodic task meets is determined and compare the lower ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1972
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/15.2.132