Abstract
Resource leveling is a variant of resource-constrained project scheduling in which a non-regular objective function, the resource availability cost, is to be minimized. We present a branch-and-price approach together with a new heuristic to solve the more general turnaround scheduling problem. Besides precedence and resource constraints, also availability periods and multiple modes per job have to be taken into account. Time-indexed mixed integer programming formulations for similar problems quite often fail already on instances with only 30 jobs, depending on the network complexity and the total freedom of arranging jobs. A reason is the typically very weak linear programming relaxation. In particular for larger instances, our approach gives tighter bounds, enabling us to optimally solve instances with 50 multi-mode jobs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Achterberg, T.: SCIP: solving constraint integer programs. Math. Programming Computation 1(1), 1–41 (2009)
Bianco, L., Caramia, M.: A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations. Computers and Operations Research (in press, 2009)
Brucker, P., Drexl, A., Möhring, R., Neumann, K., Pesch, E.: Resource-constrained project scheduling: Notation, classification, models, and methods. European J. Oper. Res. 112, 3–41 (1999)
Brucker, P., Knust, S.: A linear programming and constraint propagation-based lower bound for the RCPSP. European J. Oper. Res. 127(2), 355–362 (2000)
Demeulemeester, E.: Minimizing resource availability costs in time-limited project networks. Management Sci. 41, 1590–1598 (1995)
Demeulemeester, E.L., Herroelen, W.S.: Project Scheduling: A Research Handbook. Kluwer, Dordrecht (2002)
Drexl, A., Kimms, A.: Optimization guided lower and upper bounds for the resource investment problem. The Journal of the Operational Research Society 52(3), 340–351 (2001)
Desrosiers, J., Lübbecke, M.E.: A primer in column generation. In: Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds.) Column Generation, pp. 1–32. Springer, Berlin (2005)
Franck, B., Neumann, K., Schwindt, C.: Project scheduling with calendars. OR Spektrum 23, 325–334 (2001)
Hartmann, S.: Project scheduling with multiple modes: A genetic algorithm. Ann. Oper. Res. 102(1-4), 111–135 (2001)
Hartmann, S., Briskorn, D.: A survey of variants and extensions of the resource-constrained project scheduling problem. European J. Oper. Res. (in press, 2009)
Megow, N., Möhring, R.H., Schulz, J.: Decision support and optimization in shutdown and turnaround scheduling. INFORMS J. Computing (2010) (fourthcoming)
Möhring, R.H.: Minimizing costs of resource requirements in project networks subject to a fixed completion time. Oper. Res. 32(1), 89–120 (1984)
Mercier, L., Van Hentenryck, P.: Edge finding for cumulative scheduling. INFORMS J. Computing 20(1), 143–153 (2008)
Neumann, K., Schwindt, C., Zimmermann, J.: Project scheduling with time windows and scarce resources. Springer, Heidelberg (2003)
Project Scheduling Problem LIBrary, http://129.187.106.231/psplib/ (last accessed 2010/02/01)
Pritsker, A.A.B., Watters, L.J., Wolfe, P.M.: Multi project scheduling with limited resources: A zero-one programming approach. Management Sci. 16, 93–108 (1969)
Solving Constraint Integer Programs, http://scip.zib.de/
Zhan, J.: Calendarization of time planning in MPM networks. ZOR – Methods and Models for Oper. Res. 36(5), 423–438 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Coughlan, E.T., Lübbecke, M.E., Schulz, J. (2010). A Branch-and-Price Algorithm for Multi-mode Resource Leveling. In: Festa, P. (eds) Experimental Algorithms. SEA 2010. Lecture Notes in Computer Science, vol 6049. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13193-6_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-13193-6_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13192-9
Online ISBN: 978-3-642-13193-6
eBook Packages: Computer ScienceComputer Science (R0)