Skip to main content

Scheduling of Re-entrant Lines with Neuro-Dynamic Programming Based on a New Evaluating Criterion

  • Conference paper
Advances in Neural Networks - ISNN 2006 (ISNN 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3973))

Included in the following conference series:

Abstract

Scheduling of re-entrant lines is very important for manufacturing systems. For some dynamic scheduling methodologies, it is necessary to model a production system with finite-state discrete-time Markov process. However, proper state cannot be found as absorbing state of Markov process when general Mean Output Rate is employed as an evaluating criterion. Mean-Output-parts Number Before First Block is presented to be a new evaluating criterion in this paper to evaluate scheduling policies for Closed Re-entrant Lines(CRL). Simulations of four static scheduling policies verify the new criterion. In order to apply a Neuro-Dynamic Programming (NDP) method to scheduling of a CRL, cost-to-go value function and transition cost function are presented as new forms under the new criterion. In addition, the policy obtained in a less-number parts system by the NDP is applied in a more-number parts system directly, whose results are satisfactory.

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 119.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Kumar, P.R.: Re-entrant Lines. Queuing Systems: Theory and Applications. Special Issue on Queuing Networks 13, 87–110 (1993)

    MATH  Google Scholar 

  2. Lu, S.C.H., Ramaswamy, D., Kumar, P.R.: Efficient Scheduling Policies to Reduce Mean and Variance of Cycle-time in Semiconductor Manufacturing Plants. IEEE Trans. Semiconductor Manufacturing 7, 374–385 (1994)

    Article  Google Scholar 

  3. Lu, S.C.H., Kumar, P.R.: Fluctuation Smoothing Scheduling Policies for Queuing Systems. In: Workshop on Computing and Intelligent Systems, Bangalore, India, vol. 12 (1993)

    Google Scholar 

  4. Johnson, S.M.: Optimal Two and Three-stage Production Schedules with Set-up Times Included. Nav. Res. Logistics Quart. 1, 61–68 (1954)

    Article  Google Scholar 

  5. Garey, M.R., Johnson, D.S.: Computers and Intertractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  6. Bertsekas, D.P., Tsitsiklis, J.N.: Neuro-Dynamic Programming. Athena Scientific (1996)

    Google Scholar 

  7. Lippman, S.: Applying a New Device in the Optimization of Exponential Queuing Systems. Operations Research 23, 687–710 (1975)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, Y., Jin, H., Zhu, S., Li, M. (2006). Scheduling of Re-entrant Lines with Neuro-Dynamic Programming Based on a New Evaluating Criterion. In: Wang, J., Yi, Z., Zurada, J.M., Lu, BL., Yin, H. (eds) Advances in Neural Networks - ISNN 2006. ISNN 2006. Lecture Notes in Computer Science, vol 3973. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11760191_134

Download citation

  • DOI: https://doi.org/10.1007/11760191_134

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34482-7

  • Online ISBN: 978-3-540-34483-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics