Skip to main content

Reformulation and Solution Approaches for an Integrated Scheduling Model

  • Conference paper
Computational Science and Its Applications - ICCSA 2006 (ICCSA 2006)

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

Included in the following conference series:

Abstract

The time continuous integrated multi-item capacitated dynamic scheduling model with non-granular lot sizes and lot start times and dynamic demand functions as its key elements has recently been developed by Jodlbauer. Here we present a reformulation for improved ease of handling as well as several methods to obtain schedules close to the optimum.

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

  1. Bomberger, E.: A dynamic programming approach to a lot size scheduling problem. Management Science 12, 778–784 (1966)

    Article  Google Scholar 

  2. Hanssmann, F.: Operations Research in Production and Inventory Control. John Wiley, New York (1962)

    MATH  Google Scholar 

  3. Harris, F.W.: How many parts to Make at once. Factory: The Magazine of Management 10(2), 135–136 (1913); Reprint, Operations Research 38(6), 947–950 (1990)

    Google Scholar 

  4. Holt, C.C., Modigliani, F., Muth, J.F., Simon, H.A.: Planning Production, Inventories and Workforce. Prentice-Hall, Englewood Cliffs (1960)

    Google Scholar 

  5. Jodlbauer, H.: An Approach for Integrated Scheduling and Lot-Sizing, European Journal of Operational Research, Available online (December 21, 2005) (in Press)

    Google Scholar 

  6. Jodlbauer, H.: An efficient algorithm for the integrated multi-item dynamic scheduling problem. Submitted to the European Journal of Operational Research

    Google Scholar 

  7. Kimemia, J.G., Gershwin, S.B.: An algorithm for the computer control of a flexible manufacturing system. IIE Transaction 15(4), 353–362 (1983)

    Article  Google Scholar 

  8. Kogan, K., Perkins, J.R.: Infinite horizon production planning with periodic demand: solvable cases and a general numerical approach. IIE Transaction 35, 61–71 (2003)

    Article  Google Scholar 

  9. Salomon, M.: Deterministic lot sizing models for Production Planning. Springer, Heidelberg (1991)

    Google Scholar 

  10. Taft, E.W.: Formulas for Exact and Approximate Evaluation – Handling Cost of Jigs and Interest Charges of Product Manufactured Included. The Iron Age 1001, 1410–1412 (1918)

    Google Scholar 

  11. Wagner, H.M., Whitin, T.M.: Dynamic Version of the Economic Lot Size Model. Management Science 5(1), 89–96 (1958)

    Article  MathSciNet  MATH  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

Jodlbauer, H., Reitner, S., Weidenhiller, A. (2006). Reformulation and Solution Approaches for an Integrated Scheduling Model. In: Gavrilova, M.L., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3984. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751649_10

Download citation

  • DOI: https://doi.org/10.1007/11751649_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34079-9

  • Online ISBN: 978-3-540-34080-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics