A Branch-and-Price Algorithm for Multi-mode Resource Leveling
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.
Unable to display preview. Download preview PDF.
- [BC09]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)Google Scholar
- [HB09]Hartmann, S., Briskorn, D.: A survey of variants and extensions of the resource-constrained project scheduling problem. European J. Oper. Res. (in press, 2009)Google Scholar
- [MMS10]Megow, N., Möhring, R.H., Schulz, J.: Decision support and optimization in shutdown and turnaround scheduling. INFORMS J. Computing (2010) (fourthcoming)Google Scholar
- [PSP]Project Scheduling Problem LIBrary, http://22.214.171.124/psplib/ (last accessed 2010/02/01)
- [SCI]Solving Constraint Integer Programs, http://scip.zib.de/