[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

A Note on Scheduling Equal-Length Jobs to Maximize Throughput

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Baptiste, P., “Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times,” Journal of Scheduling, 2, 245–252 (1999).

    Article  Google Scholar 

  • Carlier J., “Problémes d'ordonnancement à durées égales”, QUESTIO, 5(4), 219–228 (1981).

    Google Scholar 

  • Chrobak M., C. Dürr, W. Jawor, Ł. Kowalik, and M. Kurowski, “A note on scheduling equal-length jobs to maximize throughput”, technical report, arxiv.org, 2004.

  • Garey M., D. Johnson, B. Simons, and R. Tarjan, “Scheduling unit-time tasks with arbitrary release times and deadlines,” SIAM Journal on Computing, 10(2),256–269 (1981).

    Article  Google Scholar 

  • Simons. B., “A fast algorithm for single processor scheduling,” in Proceedings IEEE 19th Annual Symposium on Foundations of Computer Science (FOCS'78), 1978 pp. 246–252.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of California, Riverside, CA, 92521

    Marek Chrobak & Wojciech Jawor

  2. Laboratoire de Recherche en Informatique, Université Paris-Sud, Orsay, 91405, France

    Christoph Dürr

  3. Instytut Informatyki, Uniwersytet Warszawski, Banacha 2, Warszawa, 02-097, Poland

    Łukasz Kowalik & Maciej Kurowski

Authors
  1. Marek Chrobak
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christoph Dürr
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wojciech Jawor
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Łukasz Kowalik
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Maciej Kurowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marek Chrobak.

Additional information

Supported by NSF grants CCR-9988360, CCR-0208856, and NSF/CNRS grant INT-0340752.

Supported by the EU 5th framework programs QAIP IST-1999-11234, the NSF/CNRS grant 17171 and the CNRS/STIC 01N80/0502 and 01N80/0607 grants.

Supported by KBN grant 4T11C04425.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chrobak, M., Dürr, C., Jawor, W. et al. A Note on Scheduling Equal-Length Jobs to Maximize Throughput. J Sched 9, 71–73 (2006). https://doi.org/10.1007/s10951-006-5595-4

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-006-5595-4

Keywords

Search

Navigation