Skip to main content

Partitions and the sequence counting problem in economic lot scheduling

  • Contributed Papers
  • Conference paper
  • First Online:
Combinatorial Mathematics IX

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 952))

  • 302 Accesses

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

  1. George E. Andrews, The theory of partitions, Encyclopedia of Mathematics and its applications, vol. 2, (Addison-Wesley, Reading, Mass., 1976).

    Google Scholar 

  2. Salah E. Elmaghraby, The economic lot scheduling problem (ELSP): review and extensions, Management Sci. 24 (1977/1978) 587–598.

    Article  MATH  Google Scholar 

  3. James M. Fitz-Gerald and Elizabeth J. Billington, Manufacturing sequences for the Economic Lot Scheduling problem, Bull. Austral. Math. Soc. 24 (1981) 405–431.

    Article  MathSciNet  MATH  Google Scholar 

  4. James M. Fitz-Gerald, Repetitive multiple period cycles in the Economic Lot Scheduling problem (Operations Research Report, University of Queensland, St. Lucia, to appear).

    Google Scholar 

  5. R. R. Vemuganti, On the feasibility of scheduling lot sizes for two products on one machine, Management Sci. 24 (15) (1978) 1668–1673.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Elizabeth J. Billington Sheila Oates-Williams Anne Penfold Street

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag

About this paper

Cite this paper

Billington, E.J., Fitz-Gerald, J.M. (1982). Partitions and the sequence counting problem in economic lot scheduling. In: Billington, E.J., Oates-Williams, S., Street, A.P. (eds) Combinatorial Mathematics IX. Lecture Notes in Mathematics, vol 952. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0061980

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11601-1

  • Online ISBN: 978-3-540-39375-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics