Skip to main content

Correlation Functions for Dynamic Load Balancing of Cycle Shops

  • Chapter
Advances in Industrial Engineering and Operations Research

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 5))

  • 2161 Accesses

A cycle shop is a special job shop where all jobs (or processes P) obey different sequences of operations on the machines. In contrast to a flow shop, some operations can be repeated on some machines a number of times. The sequence of operations on the machines in a cycle shop can be nicely depicted by a cyclogram [1]. Figure 17.1(a) shows examples for a five-machine work cell, where the machines M1, …, M5 are linearly arranged to form a flow line [Fig. 17.1(a)]. We now insert an additional operation on an additional common machine (T) between each two consecutive operations in each process.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

  1. V.G. Timkovsky (2004) Cycle shop scheduling. In Handbook of scheduling. Chapman & Hall, Boca Raton, FL, pp. 7-1-7-22.

    Google Scholar 

  2. W. Meyer and C. Fiedler (2006) Auto correlation and collision avoidance in robotic flow shops. Proceedings of 45th IEEE Conference on Decision and Control CDC 2006, San Diego, Decem-ber.

    Google Scholar 

  3. C.A. Kohring (1995) dynamic load balancing for parallelized particle simulations on MIMD computers. Parallel Computing, 21: 683-693.

    Article  MATH  Google Scholar 

  4. S.A. Reveliotis (2002) Liveness enforcing supervision for sequential resource allocation sys-tems. In Synthesis and control of discrete event systems. Kluwer Academic Publishers, Boston, Dordrecht, London, pp. 203-212.

    Google Scholar 

  5. J. Blazewicz, N. Brauner, and G. Finke (2004) Scheduling with discrete resource constraints In Handbook of scheduling. Chapman & Hall, Boca Raton, FL, pp. 23-1-23-18.

    Google Scholar 

  6. M.-A. Manier and C. Bloch (2003) A classification for Hoist scheduling problems. International Journal of Flexible Manufacturing Systems, 15(1): 37-55.

    Article  Google Scholar 

  7. J.Y.-T. Leung (2004) Handbook of scheduling. Chapman & Hall, Boca Raton, FL.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Fiedler, C., Meyer, W. (2008). Correlation Functions for Dynamic Load Balancing of Cycle Shops. In: Chan, A.H.S., Ao, SI. (eds) Advances in Industrial Engineering and Operations Research. Lecture Notes in Electrical Engineering, vol 5. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74905-1_17

Download citation

Publish with us

Policies and ethics