Advertisement

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

  • Tae-Eog Lee
The Max-Plus Algebraic Approach
Part of the Lecture Notes in Control and Information Sciences book series (LNCIS, volume 199)

Keywords

Processing Order Stable Steady State Short Path Algorithm Finite Linear Combination Root Component 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice-Hall, NJ. (1993)Google Scholar
  2. Carré, B.A.: An algebra for network routing problems. Journal of Institute of Mathematics and Applications 7 (1971) 273–294Google Scholar
  3. 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–220CrossRefGoogle Scholar
  4. Cunningham-Green, R.A.: Minimax algebra. Springer-Verlag, NY. (1979)Google Scholar
  5. Floyd, R.W.: Algorithm 97, shortest path. Communication in ACM 5 (1962) 345CrossRefGoogle Scholar
  6. Glover, F., Kingman, D., Phillips, N.: A new polynomially bounded shortest path algorithm. Operations Research 33 (1985) 65–73Google Scholar
  7. Karp, R.M., Orlin, J.B.: Parametric shortest path algorithms with an application to cyclic staffing. Discrete Applied Mathematics 3 (1981) 37–45CrossRefGoogle Scholar
  8. 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
  9. Tarjan, R.: Depth-first search and linear graph algorithms. SIAM Journal of Computing 1 (1972) 146–160CrossRefGoogle Scholar

Copyright information

© Springer-Verlag London Limited 1994

Authors and Affiliations

  • Tae-Eog Lee
    • 1
  1. 1.Department of Industrial EngineeringKorea Advanced Institute of Science and Technology (KAIST)TaejonKorea

Personalised recommendations