
doi: 10.1007/bf01416228
A pattern is a sequence of disjoint intervals on a circle together with fixed distances between these intervals. The intervals may be interpreted as tasks of a job which is produced periodically on one machine. The problem consists in moving r patterns relative to each other to minimize the maximum overlapping of intervals (machines needed). An enumerative procedure for solving this problem is given.
enumerative procedure, Deterministic scheduling theory in operations research, Abstract computational complexity for mathematical programming problems, periodic job processing, pattern scheduling
enumerative procedure, Deterministic scheduling theory in operations research, Abstract computational complexity for mathematical programming problems, periodic job processing, pattern scheduling
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
