Pattern scheduling
| Autor(en): | Brucker, P. Kathmann, U. |
Stichwörter: | Economic Lot Scheduling Problem; Pattern Scheduling; Polygon Scheduling | Erscheinungsdatum: | 1990 | Herausgeber: | Physica-Verlag | Journal: | ZOR Zeitschrift für Operations Research Methods and Models of Operations Research | Volumen: | 34 | Ausgabe: | 5 | Startseite: | 381 | Seitenende: | 394 | Zusammenfassung: | 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 perio-dically on one machine. How should r patterns be moved relative to each other to minimize the maximum overlapping of intervals (machines needed)? An enumerative procedure for solving this problem is given. © 1990 Physica-Verlag. |
ISSN: | 03409422 | DOI: | 10.1007/BF01416228 | Externe URL: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-34249962751&doi=10.1007%2fBF01416228&partnerID=40&md5=9977685ae7a809cca5b14d87f7a13604 |
Zur Langanzeige
