Movatterモバイル変換


[0]ホーム

URL:


Skip to main content

Advertisement

Springer Nature Link
Log in

Preliminaries

  • Chapter
  • First Online:

Part of the book series:International Series in Operations Research & Management Science ((ISOR,volume 325))

  • 469Accesses

Abstract

We begin by introducing notation, terminology, and definitions for traditional open shop scheduling.

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

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 14871
Price includes VAT (Japan)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 18589
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide -see info
Hardcover Book
JPY 18589
Price includes VAT (Japan)
  • 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

References

  1. A.S. Asratian, T.M.J. Denley, R. Häggkvist,Bipartite Graphs and Their Applications. Cambridge Tracts in Mathematics (131) (Cambridge University Press, Cambridge, 1998)

    Google Scholar 

  2. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi,Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties (Springer, Berlin, 1999)

    Google Scholar 

  3. W. Banaszczyk, The Steinitz constant of the plane. J. Reine Angew. Math.373, 218–220 (1987)

    Google Scholar 

  4. R.B. Bapat, T.E.S. Raghavan,Nonnegative Matrices and Applications (Cambridge University Press, Cambridge, 1997)

    Google Scholar 

  5. I. Bárány, A vector-sum theorem and its application to improving flow shop guarantees. Math. Oper. Res.6, 445–452 (1981)

    Google Scholar 

  6. I. Bárány, On the power of linera dependencies, inBuilding Bridges Between Math and Computer Science, ed. by M. Grötschel, G.O.H. Katona (Springer, 2008), pp. 31–45

    Google Scholar 

  7. C. Berge,The Theory of Graphs (Dover Publications, New York, 2001)

    Google Scholar 

  8. J. Błażewicz, K. Ecker, E. Pesch, G. Schmidt, J. Wȩglarz,Handbook on Scheduling: From Theory to Applications. International Handbooks on Information Systems (Springer, Berlin, 2007)

    Google Scholar 

  9. J.A. Bondy, U.S.R. Murty,Graph Theory with Applications (North-Holland Publishing, Amsterdam, 1976)

    Google Scholar 

  10. P. Brucker,Scheduling Algorithms (Springer, Berlin, 1995)

    Google Scholar 

  11. E. Cole, K. Ost, S. Schirra, Edge-coloring bipartite multigraphs in\(O(E \log D)\). Combinatorica21, 5–12 (2001)

    Google Scholar 

  12. D. de Werra, On some combinatorial problems arising in scheduling. INFOR8, 165–175 (1970)

    Google Scholar 

  13. J. Edmonds, Maximum matching and a polyhedron with 0, 1-vertices. J. Res. Nat. Bur. Stand.69(1–2), 125–130 (1965)

    Google Scholar 

  14. H.N. Gabow, O. Kariv, Algorithms for edge coloring bipartite graphs and multigraphs. SIAM J. Comput.11, 117–129 (1982)

    Google Scholar 

  15. M.R. Garey, D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman, San Francisco, 1979)

    Google Scholar 

  16. T. Gonzalez, A note on open shop preemptive schedules. IEEE Trans. Comput.C-28, 782–786 (1979)

    Google Scholar 

  17. T. Gonzalez, Open shop scheduling, inHandbook on Scheduling: Algorithms, Models, and Performance Analysis, ed. by J.Y.-T. Leung (Chapman and Hall/CRC, 2004), pp. 6-1–6-14

    Google Scholar 

  18. T. Gonzalez, S. Sahni, Open shop scheduling to minimize finish time. J. ACM23, 665–679 (1976)

    Google Scholar 

  19. C. Gotlieb, The construction of class-teacher time-tables, inProc. IFIP Congress 62, Munich (North-Holland, Amsterdam, 1963)

    Google Scholar 

  20. R.L. Graham, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discr. Math.5, 287–326 (1979)

    Google Scholar 

  21. V.S. Grinberg, S.V. Sevast’janow, Value of the Steinitz constant (in Russian). Funktsional. Anal. i Prilozhen. (Functional Anal. Appl.)14, 125–126 (1980)

    Google Scholar 

  22. R.A. Horn, C.R. Johnson,Matrix Analysis, 2nd edn. (Cambridge University Press, Cambridge, 2013)

    Google Scholar 

  23. D. König, Über graphen und ihre anwendung auf determinantentheorie und mengenlehre. Math. Ann.77, 453–465 (1916)

    Google Scholar 

  24. A.W. Marshall, I. Olkin,Inequalities: Theory of Majorization and Its Applications (Academic Press, New York, 1979)

    Google Scholar 

  25. M.L. Pinedo,Scheduling: Theory, Algorithms, and Systems, 5th edn. (Springer, Berlin, 2016)

    Google Scholar 

  26. A. Schrijver,Combinatorial Optimization. Polyhedra and Efficiency, vol. A (Springer, Berlin, 2003)

    Google Scholar 

  27. S.V. Sevast’janow, W. Banaszczyk, To the Steinitz lemma in coordinate form. Discrete Math.169, 145–152 (1997)

    Google Scholar 

  28. E. Steinitz, Bedingt konvergente reihen und convexe systeme. J. Reine Angew. Math.143, 128–175 (1913)

    Google Scholar 

  29. G.J. Woeginger, The open shop scheduling problem, in35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), ed. by R. Niedermeier, B. Vallée. Leibniz International Proceedings in Informatics (Dagstuhl Publishing, 2018), pp. 4:1–4:12

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Memorial University of Newfoundland, St. John’s, NL, Canada

    Wieslaw Kubiak

Authors
  1. Wieslaw Kubiak

Rights and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Kubiak, W. (2022). Preliminaries. In: A Book of Open Shop Scheduling. International Series in Operations Research & Management Science, vol 325. Springer, Cham. https://doi.org/10.1007/978-3-030-91025-9_1

Download citation

Publish with us

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 14871
Price includes VAT (Japan)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 18589
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide -see info
Hardcover Book
JPY 18589
Price includes VAT (Japan)
  • 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


[8]ページ先頭

©2009-2025 Movatter.jp