Skip to main content
SpringerLink
Log in

On unit time open shops with additional restrictions

  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

Abstract

We consider open shop problems with unit processing times,n jobs have to be processed onm machines. The order in which a given job is processed on the machines is not fixed. For each job a release time or a due date may be given. Additional, we consider the restriction that every machine must perform all corresponding operations without any delay time. Unit time open shop problems with release times to minimize total completion time were unsolved up to now for both allowed and forbidden delay times. We will solve these problems in the case of two and three machines. Furthermore we will give polynomial algorithms for several no-delay-problems with due dates.

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

  1. Adiri I, Amid N (1984) Openshop and flowshop scheduling to minimize sum of completion times. Comput Opns Res 11:275–284

    Article  MATH  Google Scholar 

  2. Bräsel H (1991) Lateinische Rechtecke und Maschinenbelegung. Dissertation B, TU Magdeburg

  3. Brucker P, Jurisch B, Jurisch M (1993) Open shop problems with unit time operations. ZOR 37:59–73

    MATH  MathSciNet  Google Scholar 

  4. Cole R, Hopcroft J (1982) On edge coloring bipartite graphs. SIAM Journal on Computing 11:540–546

    Article  MATH  MathSciNet  Google Scholar 

  5. Graham RE, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann Discrete Mathematics 5:287–326

    Article  MATH  MathSciNet  Google Scholar 

  6. Kellerer H, Tautenhahn T, Wöginger GJ (1992) Open shop scheduling with release dates to minimize maximum lateness. To appear in Naval Research Log Quart

  7. Liu CY, Bulfin RL (1988) Scheduling open shops with unit processing times to minimize functions of due dates. Operations Research 36/4

  8. Tautenhahn T (1994) Scheduling unit-time open shops with deadlines. Operations Research 42/1:189–192

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Algebra und Geometrie, Fakultät für Mathematik, Otto-von-Guericke-Universität, Postfach 4120, 39016, Magdeburg, Germany

    Thomas Tautenhahn

Authors
  1. Thomas Tautenhahn
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tautenhahn, T. On unit time open shops with additional restrictions. Mathematical Methods of Operations Research 43, 215–231 (1996). https://doi.org/10.1007/BF01680373

Download citation

  • Issue Date:

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

Key words

Search

Navigation