Skip to main content
SpringerLink
Log in

Matrices in Shop Scheduling Problems

  • Chapter
Perspectives on Operations Research

Auszug

Es ist für mich eine ehrenvolle Aufgabe, einen Beitrag für dieses Buch einzubringen. Gleichzeitig ist es ein herzliches Dankeschön für Herrn Prof. Klaus Neumann für seine wissenschaftlichen Arbeiten, deren Ergebnisse ich sehr gern nutze, und für seine Unterstützung und sein stetes Interesse an der Entwicklung unserer Forschungsgruppe. Ich verbinde dies mit alien guten Wünschen für einen gesunden Ruhestand der Familie Neumann, der - dessen bin ich mir sicher - öfter auch in einen Unruhestand ausarten wird.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bräsel H (1990) Latin Rectangle in Scheduling Theory. Habilitation (in German), University Magdeburg, Germany

    Google Scholar 

  2. Bräsel H, Harborth M, Tautenhahn T, Willenius P (1999) On the set of solutions of the open shop problem. Annals of Operations Research 92:241–263

    Article  Google Scholar 

  3. Bräsel H, Harborth M, Tautenhahn T, Willenius P (1999) On the hardness of the classical job shop problem. Annals of Operations Research 92:265–279

    Article  Google Scholar 

  4. Bräsel H, Hennes H (2004) On the open-shop problem with preemption and minimizing the average completion time. European Journal of Operational Research 157:607–619

    Article  Google Scholar 

  5. Bräsel H, Kleinau M (1992) On the number of feasible schedules of the open-shop-problem — An application of special Latin rectangles. Optimization 23:251–260

    Article  Google Scholar 

  6. Bräsel H, Kleinau M (1996) New steps in the amazing world of sequences and schedules. Mathematical Methods of Operations Research 43:195–214

    Article  Google Scholar 

  7. Bräsel H, Kluge D, Werner F (1994) A polynomial algorithm for the n∣m∣O,t ij = 1, tree∣C max open-shop problem. European Journal of Operational Research 72:125–134

    Article  Google Scholar 

  8. Bräsel H, Kluge D, Werner F (1995) A polynomial algorithm for an open shop problem with unit processing times and tree constraints. Discrete Applied Mathematics 59:11–21

    Article  Google Scholar 

  9. Bräsel H, Kluge D, Werner F (1996) Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times. RAIRO Operations Research 30:65–79

    Google Scholar 

  10. Bräsel H, Tautenhahn T, Werner F (1993) Constructive heuristic algorithms for the open shop problem. Computing 51:95–110

    Article  Google Scholar 

  11. Brucker P (2001) Scheduling Algorithms, Third Edition. Springer Verlag, Berlin, Heidelberg, New York

    Google Scholar 

  12. Dhamala TN (2002) Shop Scheduling Solution-Spaces with Algebraic Characterizations. Dissertation, Shaker Verlag, Mathematics

    Google Scholar 

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

    Article  Google Scholar 

  14. Harborth M (1999) Structural Analysis of Shop Scheduling Problems: Counting Problems, Potential Optimality and New Enumeration Algorithms. Dissertation (in German), GCA-Verlag, Forschen und Wissen: Mathematik

    Google Scholar 

  15. Sotskow Y, Tautenhahn T, Werner F (1999) On the application of insertion techniques for job shop problems with setup times. RAIRO 33(2):209–245

    Article  Google Scholar 

  16. Tautenhahn T (1993) Open-Shop Problems with Unit Processing Times. Dissertation (in German), University Magdeburg

    Google Scholar 

  17. Tautenhahn T (1996) On unit-time open shops with additional restrictions. ZOR 43(2):215–231

    Google Scholar 

  18. Werner F, Winkler A (1995) Insertion techniques for the heuristic solution of the job shop problem. Discrete Applied Mathematics 58(2):191–211

    Article  Google Scholar 

  19. Willenius P (2000) Irreducibility Theory for Shop Scheduling Problems. Dissertation (in German), Shaker Verlag, Mathematics

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Heidemarie Bräsel

Authors
  1. Heidemarie Bräsel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Martin Morlock Christoph Schwindt Norbert Trautmann Jürgen Zimmermann

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Deutscher Universitäts-Verlag/GWV Fachverlage GmbH, Wiesbaden

About this chapter

Cite this chapter

Bräsel, H. (2006). Matrices in Shop Scheduling Problems. In: Morlock, M., Schwindt, C., Trautmann, N., Zimmermann, J. (eds) Perspectives on Operations Research. DUV. https://doi.org/10.1007/978-3-8350-9064-4_2

Download citation

Publish with us

Policies and ethics

Search

Navigation