Skip to main content
SpringerLink
Log in

An efficient algorithm for the job-shop problem with two jobs

Ein effizienter Algorithmus zur Lösung des Job-Shop-Scheduling-Problems mit zwei Jobs

  • Published:
Computing Aims and scope Submit manuscript

Abstract

It is well known that job-shop scheduling problems with two jobs can be formulated as shortest path problems with obstacles in the plane. A reduction of this problem to an unrestricted shortest path problem in a special networkN is constructed inO (n logn) steps wheren is the number of obstacles. The shortest path inN can be found in timeO (n).

Zusammenfassung

Es ist bekannt, daß sich Job-Shop-Scheduling-Probleme mit zwei Jobs als kürzeste Wege-Probleme mit Hindernissen darstellen lassen. Gezeigt wird, daß sich ein solches Problem mit einem Aufwand vonO (n logn) auf ein normales kürzestes Wege-ProblemP reduzieren läßt, wennn die Anzahl der Hindernisse ist.P läßt sich überdies mit einem Aufwand vonO (n) lösen.

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

Access this article

Log in via an institution

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

References

  1. Akers, S. B.: A graphical approach to production scheduling problems. Operations Research4, 244–245 (1956).

    Google Scholar 

  2. Aho, A. V., Hopcroft, J. E., Ullman, J. D.: The Design and Analysis of Computer Algorithms. Reading, Mass.: Addison-Wesley 1974.

    Google Scholar 

  3. Carlier, J., Pinson, E.: A branch and bound method for the job-shop problem. Technical Report, Institut de Mathématique Appliquées, Université de Angers, 1987.

  4. Hardgrave, W. H., Nemhauser, G. L.: A geometric model and a graphical algorithm for a sequencing problem. Operations Research11, 889–900 (1963).

    Google Scholar 

  5. Hefetz, N., Adiri, I.: An efficient optimal algorithm for the two-machines, unit-time, jobshop, schedule-length problem. Mathematics of Operations Research7, 354–360 (1982).

    Google Scholar 

  6. Jackson, J. R.: An extension of Johnson's results on job lot scheduling. Naval Research Logistic Quarterly3, 201–203 (1956).

    Google Scholar 

  7. Muth, J. F., Thompson, G. L.: Industrial Scheduling. Englewood Cliffs, N. J.: Prentice-Hall 1963.

    Google Scholar 

  8. Szwarc, W.: Solution of the Akers-Friedman scheduling problem. Opertions Research8, 782–788 (1960).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FB Mathematik/Informatik, Universität Osnabrück, Albrechtstrasse 28, D-4500, Osnabrück, Federal Republic of Germany

    P. Brucker

Authors
  1. P. Brucker
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was partially supported by the Deutsche Forschungsgemeinschaft, Projekt CODIS.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brucker, P. An efficient algorithm for the job-shop problem with two jobs. Computing 40, 353–359 (1988). https://doi.org/10.1007/BF02276919

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

ASM Subject Classification

Key words

Search

Navigation