Skip to main content
SpringerLink
Log in

Computer-Aided Way to Prove Theorems in Scheduling

  • Conference paper
  • First Online:
Algorithms — ESA’ 98 (ESA 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1461))

Included in the following conference series:

Abstract

For two scheduling problems (O3∥C max and AL3∥C max) tight bounds of the optima localization intervals are found in terms of lower bounds (\( \tilde C \) and \( \overset{\lower0.5em\hbox{$\smash{\scriptscriptstyle\frown}$}}{C} \), respectively) computable in linear time. The main part of the proof was made with an aid of computer. As a by-product, we obtain linear-time approximation algorithms for solving these problems with worst-case performance ratios 4/3 and 5/3, respectively.

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

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. Appel, K., Haken, W.: Every planar map is four colorable. A.M.S. Contemporary Math. 98 (1989), 741 pp.

    Google Scholar 

  2. Bárány, I., Fiala, T.: Nearly optimum solution of multimachine scheduling problems. Szigma — Mat.-Közgaz-dasági Folyóirat, 15 (1982) 177–191.

    MATH  Google Scholar 

  3. Gonzalez, T., Sahni, S.: Open shop scheduling to minimize finish time. J. Assoc. Comput. Mach., 23 (1976) 665–679.

    MATH  MathSciNet  Google Scholar 

  4. Chen, B., Strusevich, V.A.: Approximation algorithms for three-machine open shop scheduling. ORSA Journal on Computing, 5 (1993) 321–326.

    MATH  Google Scholar 

  5. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: Sequencing and scheduling: algorithms and complexity. Handbooks in Operations Research and Management Science, Amsterdam, 1993, Vol. 4, 445–522.

    Article  Google Scholar 

  6. Johnson, S.M.: Optima two-and three-stage production schedules with setup times included. Naval Res. Logist. Quart., 1 (1954), 61–68.

    Article  Google Scholar 

  7. Potts, C.N., Sevast’janov, S.V., Strusevich, V.A., Van Wassenhove, L.N., Zvaneveld, C.M.: The two-stage assembly scheduling problem: complexity and approximation. Oper. Res. 43 (1995) 346–355.

    Article  MATH  MathSciNet  Google Scholar 

  8. Sevastianov, S.V., Woeginger, G.J.: Makespan Minimization in Open Shops: a Polynomial Time Approximation. SFB-Report 68, Mai 1996, TU Graz, Austria.

    Google Scholar 

  9. Williamson, D.P., Hall, L.A., Hoogeveen, J.A., Hurkens, C.A.J., Lenstra, J.K., Sevastianov, S.V., Shmoys, D.B.: Short Shop Schedules. Oper. Res., 45 (1997), No.2, 288–294.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Universitetskii prosp. 4, 630090, Novosibirsk-90, Russia

    S. V. Sevastianov

  2. Department of Algebra and Mathematical Logic, Novosibirsk State Technical University, pr. Marksa, 20, 630092, Novosibirsk-92, Russia

    I. D. Tchernykh

Authors
  1. S. V. Sevastianov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. D. Tchernykh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Elettronica e Informatica, Università di Padova, via Gradenigo 6/A, I-35131, Padova, Italy

    Gianfranco Bilardi  & Geppino Pucci  & 

  2. Department of Electrical Engineering and Computer Science, The University of Illinois at Chicago, 851 South Morgan Street - 1009 SEO, Chicago, IL, 60607-7053, USA

    Gianfranco Bilardi

  3. Dipartimento di Matematica Applicata e Informatica, Università “Cá Foscari” di Venezia, via Torino 155, I-30173, Venezia Mestre, Italy

    Giuseppe F. Italiano

  4. Dipartimento di Matematica Pura e Applicata, Università di Padova, via Belzoni 7, I-35131, Padova, Italy

    Andrea Pietracaprina

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sevastianov, S.V., Tchernykh, I.D. (1998). Computer-Aided Way to Prove Theorems in Scheduling. In: Bilardi, G., Italiano, G.F., Pietracaprina, A., Pucci, G. (eds) Algorithms — ESA’ 98. ESA 1998. Lecture Notes in Computer Science, vol 1461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68530-8_42

Download citation

  • DOI: https://doi.org/10.1007/3-540-68530-8_42

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64848-2

  • Online ISBN: 978-3-540-68530-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation