Skip to main content

MILP-Formulations for the Total Adjustment Cost Problem

  • Conference paper
  • First Online:
Operations Research Proceedings 2012

Part of the book series: Operations Research Proceedings ((ORP))

  • 1957 Accesses

Abstract

In this paper, we present MILP-formulations for project scheduling problems subject to general temporal constraints, where the fluctuation of resource utilizations within the project duration is to be minimized (resource leveling). Particularly, we consider a resource leveling objective function that coincides with the cumulative costs arising from increasing or decreasing the requirements of resources. The resulting “total adjustment cost problem” has achieved little attention in the literature, although it seems to be of considerable importance in real-life applications. A comprehensive performance analysis is provided showing that medium- as well as large-scale instances can be solved to optimality using CPLEX 12.4.

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 EPUB and 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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Ballestin, F., Schwindt, C., Zimmermann, J.: Resource leveling in make-to-order production: modeling and heuristic solution method. Int. J. Oper. Res. 4, 50–62 (2007)

    Google Scholar 

  2. Burgess, A., Killebrew, J.: Variation in activity level on a cyclical arrow diagram. J. Ind. Eng. 13(2), 76–83 (1962)

    Google Scholar 

  3. Koné, O., Artigues, C., Lopez, P., Mongeau, M.: Event-based MILP models for resource-constrained project scheduling problems. Comput. Oper. Res. 38(1), 3–13 (2011)

    Google Scholar 

  4. Neumann, K., Schwindt, C., Zimmermann, J.: Project scheduling with time windows and scarce resources. Springer, Berlin (2003)

    Book  Google Scholar 

  5. Pritsker, A., Watters, L., Wolfe, P.: Multi-project scheduling with limited resources: a zero-one programming approach. Manage. Sci. 16, 93–108 (1969)

    Article  Google Scholar 

  6. Rieck, J., Zimmermann, J., Gather, T.: Mixed-Integer Linear Programming for Resource Leveling Problems. Eur. J. Oper. Res. 221, 27–37 (2012)

    Article  Google Scholar 

  7. Zimmermann, J.: Heuristics for resource levelling problems in project scheduling with minimum and maximum time lags. Technical Report WIOR-491, University of Karlsruhe (1997).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Stefan Kreter .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Kreter, S., Rieck, J., Zimmermann, J. (2014). MILP-Formulations for the Total Adjustment Cost Problem. In: Helber, S., et al. Operations Research Proceedings 2012. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-00795-3_61

Download citation

Publish with us

Policies and ethics