Skip to main content
SpringerLink
Log in

Stable earliest starting schedules for periodic job shops: A linear system approach

  • The Max-Plus Algebraic Approach
  • Conference paper
  • First Online:
11th International Conference on Analysis and Optimization of Systems Discrete Event Systems

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 199))

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

  • Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice-Hall, NJ. (1993)

    Google Scholar 

  • Carré, B.A.: An algebra for network routing problems. Journal of Institute of Mathematics and Applications 7 (1971) 273–294

    Google Scholar 

  • Cohen, G., Dubois, D., Quadrat, J.P., Viot, M.: A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing. IEEE Transactions on Automatic Control 30 (1985) 210–220

    Article  Google Scholar 

  • Cunningham-Green, R.A.: Minimax algebra. Springer-Verlag, NY. (1979)

    Google Scholar 

  • Floyd, R.W.: Algorithm 97, shortest path. Communication in ACM 5 (1962) 345

    Article  Google Scholar 

  • Glover, F., Kingman, D., Phillips, N.: A new polynomially bounded shortest path algorithm. Operations Research 33 (1985) 65–73

    Google Scholar 

  • Karp, R.M., Orlin, J.B.: Parametric shortest path algorithms with an application to cyclic staffing. Discrete Applied Mathematics 3 (1981) 37–45

    Article  Google Scholar 

  • Lee, T.E., Posner, M.E.: Performance measures and schedules in periodic job shops. The Ohio State University, Department of Industrial and Systems Engineering. Working Paper 1990-012. (1990)

    Google Scholar 

  • Tarjan, R.: Depth-first search and linear graph algorithms. SIAM Journal of Computing 1 (1972) 146–160

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Korea Advanced Institute of Science and Technology (KAIST), 373-1 Gusung-Dong, Yusong-Gu, 305-701, Taejon, Korea

    Tae-Eog Lee

Authors
  1. Tae-Eog Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Guy Cohen Jean-Pierre Quadrat

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag London Limited

About this paper

Cite this paper

Lee, TE. (1994). Stable earliest starting schedules for periodic job shops: A linear system approach. In: Cohen, G., Quadrat, JP. (eds) 11th International Conference on Analysis and Optimization of Systems Discrete Event Systems. Lecture Notes in Control and Information Sciences, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0033559

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19896-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation