Skip to main content

Advertisement

Springer Nature Link
Log in

Tighter Bounds on Preemptive Job Shop Scheduling with Two Machines

  • Published:
Computing Aims and scope Submit manuscript

Abstract

We consider the preemptive job shop scheduling problem with two machines, with the objective to minimize the makespan. We present an algorithm that finds a schedule of length at most P max/2 greater than the optimal schedule length, where P max is the length of the longest job.

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
$34.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 excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles and news from researchers in related subjects, suggested using machine learning.

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering Box 352350 University of Washington Seattle, WA 98195-2350 USA e-mail: eric@cs.washington.edu, , , , , , US

    E. J. Anderson

  2. IBM T.J. Watson Research Center PO Box 704 Yorktown Heights, NY 10598 USA e-mail: jayram@watson.ibm.com, , , , , , US

    T. S. Jayram

  3. IBM T.J. Watson Research Center PO Box 218 Yorktown Heights, NY 10598 USA e-mail: kimbrel@watson.ibm.com, , , , , , US

    T. Kimbrel

Authors
  1. E. J. Anderson
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. T. S. Jayram
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. T. Kimbrel
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

Received June 13, 2000

Rights and permissions

Reprints and permissions

About this article

Cite this article

Anderson, E., Jayram, T. & Kimbrel, T. Tighter Bounds on Preemptive Job Shop Scheduling with Two Machines. Computing 67, 83–90 (2001). https://doi.org/10.1007/s006070170017

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s006070170017