Results 1  10
of
82,076
Cyclic Scheduling
 OFFICE FOR OFFICIAL PUBLICATIONS OF THE EUROPEAN COMMUNITIES
, 1999
"... In this paper we consider the problem of cyclic schedules such as arise in manufacturing. We introduce a new formulation of this problem that is a very simple modi cation of a standard job shop scheduling formulation, and which enables us to use existing constraint reasoning techniques to generate c ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
In this paper we consider the problem of cyclic schedules such as arise in manufacturing. We introduce a new formulation of this problem that is a very simple modi cation of a standard job shop scheduling formulation, and which enables us to use existing constraint reasoning techniques to generate
CYCLIC SCHEDULING AND DIOPHANTINE PROBLEMS
"... Cyclic scheduling concerns both kinds of questions following the deductive and inductive ways of reasoning. First class of problems concentrates on rules aimed at resources assignment as to minimize a given objective function, e.g. the cycle time, the flow time of a job. In turn, the second class fo ..."
Abstract
 Add to MetaCart
Cyclic scheduling concerns both kinds of questions following the deductive and inductive ways of reasoning. First class of problems concentrates on rules aimed at resources assignment as to minimize a given objective function, e.g. the cycle time, the flow time of a job. In turn, the second class
Cyclic Scheduling on Parallel Processors: An Overview
, 1994
"... A recent research effort has been devoted to cyclic scheduling problems that arise in the design of compilers for parallel architectures as well as in manufacturing systems. This paper is focused on the extensions of the basic cyclic scheduling problem (BCS), that seems to be one of the most suitabl ..."
Abstract

Cited by 31 (2 self)
 Add to MetaCart
A recent research effort has been devoted to cyclic scheduling problems that arise in the design of compilers for parallel architectures as well as in manufacturing systems. This paper is focused on the extensions of the basic cyclic scheduling problem (BCS), that seems to be one of the most
Efficient Algorithms for Cyclic Scheduling
 Res. Rep. RC 17068, IBM T. J. Watson
, 1991
"... This work addresses the problem of nonpreemptively scheduling a cyclic set of interdependent operations, representing for instance a program loop, when p identical processors are available. For p = 1 we give a simple, efficient, polynomial time algorithm producing optimum results. When p ! 1 the ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
This work addresses the problem of nonpreemptively scheduling a cyclic set of interdependent operations, representing for instance a program loop, when p identical processors are available. For p = 1 we give a simple, efficient, polynomial time algorithm producing optimum results. When p ! 1
Some complexity results in cyclic scheduling
 Mathematical and Computer Modelling
, 1994
"... precedence constraints graph In this paper we investigate the complexity of various cyclic scheduling problems in flowshop, jobshop and other environments. We review existing results and provide proofs for two new complexity results: We show that maximizing throughput in a flexible assembly line ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
precedence constraints graph In this paper we investigate the complexity of various cyclic scheduling problems in flowshop, jobshop and other environments. We review existing results and provide proofs for two new complexity results: We show that maximizing throughput in a flexible assembly line
DeCycling Cyclic Scheduling Problems
"... An elegant way to tackle a problem that you cannot solve is to cast it to a problem that you can solve very well. Cyclic Scheduling problems are very similar to Resource Constrained Project Scheduling Problems (RCPSP), except that the project activities are repeated over time. Due to the similari ..."
Abstract
 Add to MetaCart
An elegant way to tackle a problem that you cannot solve is to cast it to a problem that you can solve very well. Cyclic Scheduling problems are very similar to Resource Constrained Project Scheduling Problems (RCPSP), except that the project activities are repeated over time. Due
Petri Net Based Cyclic Scheduling
"... Loop scheduling is particularly importantwhendesigning efficient compilers for parallel architectures. In this article a cyclic schedule of nonpreemptive tasks with precedence constraints and no communication delays on an unlimited number of identical processors will be proposed. In addition an att ..."
Abstract
 Add to MetaCart
Loop scheduling is particularly importantwhendesigning efficient compilers for parallel architectures. In this article a cyclic schedule of nonpreemptive tasks with precedence constraints and no communication delays on an unlimited number of identical processors will be proposed. In addition
The end of the line for static cyclic scheduling
 In Proc. 5th Euromicro Workshop on RealTime Systems
, 1993
"... One common way of constructing hard realtime systems is to use a number of periodic and sporadic tasks assigned static priorities and dispatched at runtime according to the preemptive priority scheduling algorithm. Most analysis for such systems attempts to find the worstcase response time for ea ..."
Abstract

Cited by 55 (6 self)
 Add to MetaCart
One common way of constructing hard realtime systems is to use a number of periodic and sporadic tasks assigned static priorities and dispatched at runtime according to the preemptive priority scheduling algorithm. Most analysis for such systems attempts to find the worstcase response time
CICLIC: A Tool to Generate Feasible Cyclic Schedules
"... A common way of implementing periodic realtime systems is by means of a cyclic scheduler. This method of scheduler is characterized by having a high degree of determinism, a high degree of predictability, a high degree of reliability, and implementation simplicity. Also, it is a very wellknown meth ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A common way of implementing periodic realtime systems is by means of a cyclic scheduler. This method of scheduler is characterized by having a high degree of determinism, a high degree of predictability, a high degree of reliability, and implementation simplicity. Also, it is a very wellknown
Results 1  10
of
82,076