منابع مشابه
The basic cyclic scheduling problem with deadlines
The purpose of this paper is to study the latest schedule existence, calculation and properties of a basic cyclic scheduling problem with deadlines. First it is shown that, in the general case, a latest schedule exists but may be difficult to compute. Then we focus on a special case we call the optimal cyclic production problem. We derive an upper bound for the number of maximal-path values nee...
متن کاملThe Basic Cyclic Scheduling Problem with Linear Precedence Constraints
In this paper, we consider a nite set of generic tasks that we execute a large number of times. We introduce the linear constraints between two generic tasks : the di erence of iteration indices between the execution of two tasks subject to a precedence constraint is a linear function of these indices. These constraints are modeled by a linear graph G. Moreover, we consider no resource constrai...
متن کاملThe cyclic compact open-shop scheduling problem
We consider a variation of the classical nonpreemptive open-shop scheduling problem. For the normal open shop, finding whether a schedule exists in T time units is NP-complete [2]. The main difference with the classical model is that we will consider so-called periodical or cyclic schedules; this means that the schedule obtained is repeated periodically. If the length of a period is k time unit...
متن کاملA polynomial algorithm for a bi-criteria cyclic scheduling problem
The minimization of the amount of initial tokens in a Weighted Timed Event Graph (in short WTEG) under throughput constraint is a crucial problem in industrial area such as the design of manufacturing systems or embedded systems. In this paper, an efficient polynomial algorithm is developed for the minimization of the overall places capacities with a maximum throughput. It is proved optimal for...
متن کاملA Study of the Cyclic Scheduling Problem on Parallel Processors
We address the problem of scheduling a set of generic tasks to be performed in nitely often without preemption on nitely many parallel processors. These tasks are subject to a set of uniform constraints, modeled by a uniform graph G. The problem is to nd a periodic schedule that minimizes the cycle time. Although the problem is NPhard, we show that the special case where G is a circuit can be s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURO Journal on Computational Optimization
سال: 2018
ISSN: 2192-4406,2192-4414
DOI: 10.1007/s13675-018-0100-3