A New Metaheuristic for Float Management in Resource-constrained Project Scheduling - A Bi-criteria Approach

Roni Levi, Sándor Danka

Abstract

In this paper, we present a new unified theoretical model and the conception of the corresponding heuristic algorithm to solve several "what if" like float management problems in resource-constrained project scheduling. The traditional time-oriented resource-constrained project scheduling model for makespan minimization gives an optimal starting time set therefore an activity movement, may be able to destroy the resource-feasibility. The float management, as a stating base, needs a so-called forbidden-set oriented model (a forbidden-set oriented heuristic), which gives an optimal resource conflict repairing relation set. After inserting the additional predecessor-successor relations, in a optimal schedule every movable activity can be moved without destroying the resource feasibility. In the other side, when we have a forbidden-set oriented schedule, then according to the total free float, we have some freedom to redistribute the float among activities to answer several "what if" like questions. For example, in the planning phase we can investigate the consequences of a delay or a longer duration which may be caused by a notorious element of the "critical" activity subset. The unified float management as a new tool was built into the forbidden-set oriented Sounds of Silence (SoS) metaheuristic frame (Csébfalvi et al., 2008a). From theoretical point of view, float management is invariant to the applied heuristic frame; therefore it can be built into any other heuristic which is developed to solve forbidden-set oriented resource-constrained project scheduling problem (RCPSP). The toolbox can be completed by any other new element (float measure), which can be described as a linear programming (LP) or a simple mixed integer linear programming (MILP) problem on the set of the forbidden-set oriented (freely movable without resource-conflicts) solutions as a problem-specific redistribution of the total free float of the project. The essence and viability of our unified approach is illustrated by a set of examples.

References

  1. Alvarez-Valdés, R., Tamarit, J. M., 1993. The project scheduling polyhedron: Dimension, facts and lifting theorems, European Journal of Operational Research, 96, 204-220.
  2. Bowers, J. A., 1995. Criticality in Resource Constrained Networks, Journal of Operational Research Society, 46, 80-91.
  3. Bowers, J. A., 2000. Interpreting Float in Resource Constrained Projects, International Journal of Project Management, 18, 385-392.
  4. Csébfalvi A., Láng, B., 2011. An improved hybrid method for the resource-constrained project scheduling problem with discounted cash flows. Pollack Periodica: An International Journal For Engineering and Information Sciences, 6 (3), 1-12.
  5. Csébfalvi, A., Szendroi, E., 2012. An improved hybrid method for the multi-mode resource-constrained project scheduling problem. In Tooping, B.H.V. (Ed.), Proceedings of the Eight International Conference on Engineering Computational Technology, (ECT 2012/00036).
  6. Csébfalvi, G., Eliezer, O., Láng, B., Levi, R., 2008a. A conflict repairing harmony search metaheuristic and its application for bi-objective resource-constrained project scheduling problems, Project Management and Scheduling 2008, Istanbul, Turkey, 60-63, 2008.
  7. Csébfalvi, G., Csébfalvi, A., Szendroi, E., 2008b. A harmony search metaheuristic for the resourceconstrained project scheduling problem and its multimode version, Project Management and Scheduling 2008, Istanbul, Turkey, 56-59.
  8. Kolisch, R., Sprecher, A., 1996. PSPLIB - a project scheduling library. European Journal of Operational Research, 96, 205-216.
  9. Lee K. S., Geem Z. W., 2005. A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice, Computer Methods in Applied Mechanics and Engineering, 194, 3902-3933
  10. Levi, R., 2004. Criticality in Resource Constrained Projects, PhD Dissertation, University of Pécs, Hungary.
  11. Ragsdale, C., 1989. The Current State of Network Simulation in Project Theory and Practice, Omega, 17, 21-25.
  12. Raz, T., Marshall, B., 1996. Effect of Resource Constraints on Float Calculation in Project Networks, International Journal of Project Management, 14, 241-248.
  13. Weist, J. D., 1967. Heuristic Model for Scheduling Large Projects with Limited Resources, Management Science, 13, 359-377.
Download


Paper Citation


in Harvard Style

Levi R. and Danka S. (2012). A New Metaheuristic for Float Management in Resource-constrained Project Scheduling - A Bi-criteria Approach . In Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2012) ISBN 978-989-8565-33-4, pages 290-293. DOI: 10.5220/0004152702900293


in Bibtex Style

@conference{ecta12,
author={Roni Levi and Sándor Danka},
title={A New Metaheuristic for Float Management in Resource-constrained Project Scheduling - A Bi-criteria Approach},
booktitle={Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2012)},
year={2012},
pages={290-293},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004152702900293},
isbn={978-989-8565-33-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2012)
TI - A New Metaheuristic for Float Management in Resource-constrained Project Scheduling - A Bi-criteria Approach
SN - 978-989-8565-33-4
AU - Levi R.
AU - Danka S.
PY - 2012
SP - 290
EP - 293
DO - 10.5220/0004152702900293