Skip to main content
SpringerLink
Log in

The total adjustment cost problem: Applications, models, and solution algorithms

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

Resource leveling problems arise whenever it is expedient to reduce the fluctuations in resource utilization over time, while maintaining a prescribed project completion deadline. Several resource leveling objective functions may be defined, consideration of which results in well-balanced resource profiles. In this paper, we concentrate on a special objective function that determines the costs arising from increasing or decreasing the resource utilizations. The resulting total adjustment cost problem occurs, for example, in the construction industry and can be formulated using mixed-integer linear programming models. Apart from a discrete time-based formulation, two polynomial formulations, namely an event-based model and a start-based model, which exploit structural properties of the problem are presented. In addition, a heuristic solution algorithm is proposed to generate start solutions for the problem. We use CPLEX 12.4 to solve medium-scale instances known from the literature. A computational performance analysis shows that the discrete time-based model and the start-based model are suitable for practical applications.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  • Ahuja, H. N. (1976). Construction performance control by networks. New York: Wiley.

    Google Scholar 

  • Ahuja, R., Magnanti, T., & Orlin, J. (1993). Network flows. Englewood Cliffs: Prentice Hall.

    Google Scholar 

  • Al-Joma, M. & Mangin, J.-C. (2004). A scheduling model for repetitive activities. In F. Khosrowshahi, (Ed.), Proceedings 20th Annual Association of Researchers in Construction Management (ARCOM) Conference (pp. 1197–1206), Edinburgh.

  • Ballestin, F., Schwindt, C., & Zimmermann, J. (2007). Resource leveling in make-to-order production: Modeling and heuristic solution method. International Journal of Operations Research, 13(2), 76–83.

    Google Scholar 

  • Bandelloni, M., Tucci, M., & Rinaldi, R. (1994). Optimal resource leveling using non-serial dynamic programming. European Journal of Operational Research, 78, 162–177.

    Article  Google Scholar 

  • Bartusch, M., Möhring, R., & Radermacher, F. (1988). Scheduling project networks with resource constraints and time windows. Annals of Operations Research, 16, 201–240.

    Article  Google Scholar 

  • Blaskova, M., & Grazulis, V. (2009). Motivation of human potential: Theory and practice. Vilnius, Lithuania: Publishing Centre of Mykolas Romeris University.

    Google Scholar 

  • Burgess, A., & Killebrew, J. (1962). Variation in activity level on a cyclical arrow diagram. Journal of Industrial Engineering, 13, 76–83.

    Google Scholar 

  • Demeulemeester, E., & Herroelen, W. (2002). Project scheduling: A research handbook. Boston: Kluwer.

    Google Scholar 

  • Easa, S. M. (1989). Resource leveling in construction by optimization. Journal of Construction Engineering and Management, 115, 302–316.

    Article  Google Scholar 

  • Galbreath, R. V. (1965). Computer program for leveling resource usage. Journal of the Construction Division, Proceedings of the American Society of Civil Engineers, 91, 107–124.

    Google Scholar 

  • Gather, T., Zimmermann, J., & Bartels, J.-H. (2011). Exact methods for the resource levelling problem. Journal of Scheduling, 14(6), 557–569.

    Article  Google Scholar 

  • Geng, J., Weng, L., & Liu, S. (2011). An improved ant colony optimization algorithm for nonlinear resource-leveling problems. Computers and Mathematics with Applications, 61, 2300–2305.

    Article  Google Scholar 

  • Harris, R. B. (1978). Precedence and arrow networking techniques for construction. New York: Wiley.

    Google Scholar 

  • Harris, R. B. (1990). Packing method for resource leveling (Pack). Journal of Construction Engineering and Management, 116, 39–43.

    Google Scholar 

  • Harris, R. B., & Ioannou, P. G. (1998). Scheduling projects with repeating activities. Journal of Construction Engineering and Management, 124, 269–279.

    Article  Google Scholar 

  • Hartmann, S., & Briskorn, D. (2010). A survey of variants and extensions of the resource-constrained project scheduling problem. European Journal of Operational Research, 207, 1–14.

    Article  Google Scholar 

  • Haubrich, H.-J., Siemes, P., & Ohrem, S. (2008). Möglichkeiten der Netzintegration von Offshore-Großwindanlagen. In P. Dietz (Ed.), Netzintegration von Offshore-Großwindanlagen: Grundlast von der Nordsee (pp. 167–177). Clausthal-Zellerfeld: Papierflieger.

    Google Scholar 

  • Koné, O., Artigues, C., Lopez, P., & Mongeau, M. (2011). Event-based MILP models for resource-constrained project scheduling problems. Computers and Operations Research, 38, 3–13.

    Article  Google Scholar 

  • Moder, J. J., & Phillips, C. R. (1970). Project Management with CPM and PERT (2nd ed.). New York: Van Nostrand Reinhold Company.

  • Neumann, K., Schwindt, C., & Zimmermann, J. (2003a). Order-based neighborhoods for project scheduling with nonregular objective functions. European Journal of Operational Research, 149, 325–343.

    Article  Google Scholar 

  • Neumann, K., Schwindt, C., & Zimmermann, J. (2003b). Project scheduling with time windows and scarce resources (2nd ed.). Berlin: Springer.

    Book  Google Scholar 

  • Neumann, K., Schwindt, C., & Zimmermann, J. (2006). Resource-constrained project scheduling with time windows. In J. Józefowska & J. Weglarz (Eds.), Perspectives in modern project scheduling (pp. 375–407). New York: Springer.

  • Neumann, K., & Zimmermann, J. (1999). Resource levelling for projects with schedule-dependent time windows. European Journal of Operational Research, 117, 591–605.

    Article  Google Scholar 

  • Neumann, K., & Zimmermann, J. (2000). Procedures for resource levelling and net present value problems in project scheduling with general temporal and resource constraints. European Journal of Operational Research, 127, 425–443.

    Article  Google Scholar 

  • Nübel, H. (2001). The resource renting problem subject to temporal constraints. OR Spektrum, 23, 359–381.

    Article  Google Scholar 

  • Petrovic, R. (1969). On optimization of resource leveling in project plans. In H. J. Lombaers (Ed.), Project Planning by Network Analysis: Proceedings of the Second International Congress (pp. 268–273). Amsterdam, North-Holland.

  • Pritsker, A. A. B., Watters, L. J., & Wolfe, P. M. (1969). Multi-project scheduling with limited resources: A zero-one programming approach. Management Science, 16, 93–108.

    Article  Google Scholar 

  • Raja, K., & Kumanan, S. (2007). Resource leveling using petrinet and memetic approach. American Journal of Applied Science, 4(5), 317–322.

    Article  Google Scholar 

  • Rieck, J., Zimmermann, J., & Gather, T. (2012). Mixed-integer linear programming for resource leveling problems. European Journal of Operational Research, 221, 27–37.

    Article  Google Scholar 

  • Savin, D., Alkass, S., & Fazio, P. (1997). A procedure for calculating the weight-matrix of a neural network for resource leveling. Advances in Engineering Software, 28, 277–283.

    Article  Google Scholar 

  • Schwindt, C. (1998). Generation of resource-constrained project scheduling problems subject to temporal constraints. WIOR-Report 543, Institute for Economic Theory and Operations Research, University Karlsruhe, Germany.

  • Schwindt, C. (2005). Resource allocation in project management. Berlin: Springer.

    Google Scholar 

  • Steinboeck, A., Wild, D., & Kugi, A. (2013). Nonlinear model predictive control of a continuous slab reheating furnace. Control Engineering Practice, 21, 495–508.

    Article  Google Scholar 

  • Takamoto, M., Yamada, N., Kobayashi, Y., & Nonaka, H. (1995). Zero-one quadratic programming algorithm for resource leveling of manufacturing process schedules. Systems and Computers in Japan, 26(10), 68–76.

    Article  Google Scholar 

  • Younis, M. A., & Saad, B. (1996). Optimal resource leveling of multi-resource projects. Computers and Industrial Engineering, 31, 1–4.

    Article  Google Scholar 

  • Zhuchkov, S. M. (2004). Conserving energy and resources in the production of rolled sections and wire rod. Metallurgist, 48, 528–535.

    Article  Google Scholar 

  • Zimmermann, J. (1997). Heuristics for resource levelling problems in project scheduling with minimum and maximum time lags. WIOR-Report 491, Institute for Economic Theory and Operations Research, University Karlsruhe, Germany.

  • Zimmermann, J. (2001). Ablauforientiertes Projektmanagement: Modelle Verfahren und Anwendungen. Wiesbaden: Gabler.

    Book  Google Scholar 

Download references

Acknowledgments

The benchmarks for the total adjustment cost problem presented herein and the results obtained (i.e., upper and lower bounds) may be downloaded from http://www.wiwi.tu-clausthal.de/abteilungen/unternehmensforschung/forschung.

Author information

Authors and Affiliations

  1. Operations Research Group, Institute of Management and Economics, Clausthal University of Technology, 38678,  Clausthal-Zellerfeld, Germany

    Stefan Kreter, Julia Rieck & Jürgen Zimmermann

Authors
  1. Stefan Kreter
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Julia Rieck
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jürgen Zimmermann
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Stefan Kreter.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kreter, S., Rieck, J. & Zimmermann, J. The total adjustment cost problem: Applications, models, and solution algorithms. J Sched 17, 145–160 (2014). https://doi.org/10.1007/s10951-013-0344-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-013-0344-y

Keywords

Search

Navigation