Skip to main content
SpringerLink
Log in

Pattern scheduling

  • Published:
Zeitschrift für Operations Research Aims and scope Submit manuscript

Abstract

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 shouldr 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.

Zusammenfassung

Ein Muster ist eine Folge von disjunkten Intervallen auf einen Kreis zusammen mit festen Abständen zwischen diesen Intervallen. Die Intervalle kann man als Operationen eines Jobs auffassen, der periodisch von einer Maschine durchgeführt wird. Wie müssenr Muster relativ zueinander angeordnet werden, um die maximale Überlappung von Intervallen (Anzahl der benötigten Maschinen) zu minimieren? Es wird ein enumeratives Verfahren zur Lösung dieses Problems angegeben.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • P. Brucker, R.E. Burkard, J. Hurink (1988) Cyclic schedules for r irregulary occuring events, Osnabrücker Schriften zur Mathematik, Reihe P, Heft 113

  • P. Brucker, W. Meyer (1988) Scheduling two irregular polygons, Discrete Applied Mathematics 20, 91–100

    Google Scholar 

  • R.E. Burkard (1986) Optimal Scheduls for periodically recurring events, Discrete Applied Mathematics 15, 167–182

    Google Scholar 

  • S.E. Elmaghraby: (1987) The Economic Lot Scheduling Problem (ELSP), Review and Extension, Management Science 24, 578–597

    Google Scholar 

  • J. Hurink (1986) Scheduling von periodischen Vorgängen, Diplomarbeit, Fachbereich Mathmatik, Universität Osnabrück

  • U. Kathmann (1987) Muster-Scheduling, Diplomarbeit, Fachbereich Mathmatik, Universität Osnabrück

  • R.R. Vemuganti (1978) On the general feasibility of scheduling lot sizes for two products on one machine, Management Science 24

  • Wen-Lian Hsu (1983) On the general feasibility of scheduling lot sizes for two products on one machine, Management Science 29, 93–105

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik/Informatik, Universität Osnabrück, Albrechtstr. 28, 4500, Osnabrück

    P. Brucker & U. Kathmann

Authors
  1. P. Brucker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. U. Kathmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was partially supported by the Deutsche Forschungsgemeinschaft (Project: Optimierung diskreter Systeme und Computergraphik).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brucker, P., Kathmann, U. Pattern scheduling. ZOR - Methods and Models of Operations Research 34, 381–394 (1990). https://doi.org/10.1007/BF01416228

Download citation

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01416228

Keywords

Search

Navigation