Advertisement

A new lower bound for the makespan of a single machine scheduling problem

  • G. Tinhofer
  • E. Farnbacher
II Mathematical Programming II.2 Discrete Optimization
  • 113 Downloads
Part of the Lecture Notes in Control and Information Sciences book series (LNCIS, volume 180)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    P. Brucker, B. Jurisch, B. Sievers, A Fast Branch & Bound Algorithm for the Job-Shop Scheduling Problem, Osnabrücker Schriften zur Mathematik, 1991, Reihe P, Heft 136Google Scholar
  2. [2]
    J. Carlier, The one-machine sequencing problem, European Journal of Operational Research 11 (1982) 42–47zbMATHCrossRefMathSciNetGoogle Scholar
  3. [3]
    C.N. Potts, Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times, Operations Research 28 (1980) 1436–1441zbMATHMathSciNetCrossRefGoogle Scholar

Copyright information

© International Federation for Information Processing 1992

Authors and Affiliations

  • G. Tinhofer
    • 1
  • E. Farnbacher
    • 1
  1. 1.Mathematisches InstitutTechnische Universität MünchenMünchen 2

Personalised recommendations