Skip to main content
SpringerLink
Log in

Scheduling in Flexible Manufacturing Systems, Supported through Cyclic Net Analysis

  • Conference paper
Robotics in Alpe-Adria Region

  • 223 Accesses

Abstract

The analytical solutions of scheduling problems in flexible manufacturing systems (FMS) can seldom be used in real time scheduling as their numerical complexity is in the NP class. However the experience with analytical solutions based on relatively small objects can be often useful when constructing real time algorithm for some basic scheduling algorithms in FMS. In problems handled, the set up mechanisms are not neglected.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • D. A. Wismer (1972). Solution of the flowshop scheduling problem with no intermediate queus. Ops.Res, 20: 689–697.

    Article  MATH  Google Scholar 

  • L. Lawler, J. K. Lenstra, G. K. (1982). Recent developments in deterministic sequencing and scheduling. M. A. H. Dempster et al.,Eds. D.Reidel Publishing Comp, Boston,MA.

    Google Scholar 

  • H.P. Hillion, J. (1989). Performance evaluation of job shop systems using time event graphs. IEEE Trans, on Automatic Control, 34 (1): 3–9.

    Article  MathSciNet  MATH  Google Scholar 

  • J.M. Korsunov (1980). Matematiceskie osnovi kybernetiki. Izd. ENERGIJA, Moskva.

    Google Scholar 

  • J.R. Perkins, P. (1989). Stable,distributed,real-time scheduling of flexible manufacturing assembly disassembly systems. IEEE Trans.Aut.Contr., 34 (2): 139–147.

    Article  MathSciNet  MATH  Google Scholar 

  • M. Gondran, M. (1984). Graphs and Algorithms. John Wiley, Inc. New York.

    MATH  Google Scholar 

  • S. Greves (1981). A review of production scheduling. Opns.Res., 29 (4): 646–675.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Robotics Laboratory, Jozef Stefan Institute, Ljubljana, Slovenia

    L. Lenart & A. Ruzic

Authors
  1. L. Lenart
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Ruzic
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Scientific Academy of Lower Austria, Krems, Austria

    Peter Kopacek

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag/Wien

About this paper

Cite this paper

Lenart, L., Ruzic, A. (1994). Scheduling in Flexible Manufacturing Systems, Supported through Cyclic Net Analysis. In: Kopacek, P. (eds) Robotics in Alpe-Adria Region. Schriftenreihe der Wissenschaftlichen Landesakademie für Niederösterreich. Springer, Vienna. https://doi.org/10.1007/978-3-7091-9346-4_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-9346-4_35

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-82545-7

  • Online ISBN: 978-3-7091-9346-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation