Skip to main content
SpringerLink
Log in

On the drift of short schedules

Extended abstract

  • Regular Presentations
  • Conference paper
  • First Online:
Algorithms and Complexity (CIAC 1997)

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

Included in the following conference series:

Abstract

For the Job Shop Scheduling (JSS) problem, the drift of a schedule is the maximum difference between the number of operations performed by two jobs within a time interval. We show instances of the JSS problem for which any short schedule must allow for nonconstant drift.

Incumbent of the Joseph and Celia Reskin Career Development Chair. Yigal Alon fellow.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Y. Azar, A.Z. Broder, A.R. Karlin, and E. Upfal. Balanced allocations. In Proc. 26th ACM Symp. on Theory of Computing, pages 593–602, 1994.

    Google Scholar 

  2. R.M. Karp, M. Luby, and F. M. auf der Heide. Efficient PRAM simulation on a distribute memory machine. Algorithmica (1996) 16:517–542.

    Google Scholar 

  3. T. Leighton, B. Maggs, and S. Rao. Packet routing and job-shop scheduling in O(congestion + dilation) steps. Combinatorica, 14(2):165–186, 1994.

    Google Scholar 

  4. G. Rayzman. Approximation techniques for job-shop scheduling problems. Master's thesis, Department of Applied Math and Computer Science, The Weizmann Institute of Science, 1996.

    Google Scholar 

  5. D. Shmoys, C. Stein, and J. Wein. Improved approximation algorithms for shop scheduling problems. SIAM Journal on Computing, 23(3):617–632, June 1994. A preliminary version of these results appeared in SODA '91.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Math and Computer Science, The Weizmann Institute, 76100, Rehovot, Israel

    Uriel Feige & Giora Rayzman

Authors
  1. Uriel Feige
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giora Rayzman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giancarlo Bongiovanni Daniel Pierre Bovet Giuseppe Di Battista

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Feige, U., Rayzman, G. (1997). On the drift of short schedules. In: Bongiovanni, G., Bovet, D.P., Di Battista, G. (eds) Algorithms and Complexity. CIAC 1997. Lecture Notes in Computer Science, vol 1203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62592-5_62

Download citation

  • DOI: https://doi.org/10.1007/3-540-62592-5_62

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62592-6

  • Online ISBN: 978-3-540-68323-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation