Advertisement

The Journal of Supercomputing

, Volume 44, Issue 3, pp 257–273 | Cite as

A mathematical model for the multi-mode resource-constrained project scheduling problem with mode dependent time lags

  • Majid Sabzehparvar
  • S. Mohammad Seyed-Hosseini
Open Access
Article

Abstract

This paper presents an exact model for the multi-mode resource-constrained project scheduling problem with generalized precedence relations in which the minimal or maximal time lags between a pair of activities may vary depending on the chosen modes. All resources considered are renewable. The objective is to determine a mode and a start time for each activity so that all constraints are obeyed and the project duration is minimized. Project scheduling of this type occurs in many fields, for instance, construction industries. The proposed model has been inspired by the rectangle packing problems. In spite of the fact that it needs a feasible solution to start for conventional models, the new model has no need for a feasible solution to start. Computational results with a set of 60 test problems have been reported and the efficiency of the proposed model has been analyzed.

Keywords

Multi-mode Rectangle packing Resource constrained Time lags Time windows 

References

  1. 1.
    Baptiste P, Demassey S (2004) Tight LP bounds for resource constrained project scheduling. OR Spectr 26:251–262 zbMATHCrossRefGoogle Scholar
  2. 2.
    Bartuch M, Möhring RH, Radermacher FJ (1988) Scheduling project networks with resource constraints and time windows. Ann Oper Res 16:201–240 MathSciNetGoogle Scholar
  3. 3.
    Brucker P, Knust S (2000) A linear programming and constraint propagation-based lower bound for RCPSP. Eur J Oper Res 127:355–362 zbMATHCrossRefGoogle Scholar
  4. 4.
    Chen HD, Xu R (2007) A new heuristic algorithm for rectangle packing. Comput Oper Res 34:3270–3280 zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Demeulemeester EL, Herroelen WS (2002) Project scheduling, a research handbook, ISBN 1-4020-7051-9. Kluwer Google Scholar
  6. 6.
    De Reyck B, Herroelen W (1999) The multi-mode resource-constrained project scheduling problem with generalized precedence relations. Eur J Oper Res 119:538–556 zbMATHCrossRefGoogle Scholar
  7. 7.
    Dorndorf U (2002) Project scheduling with time windows, from theory to application, ISBN 3-7908-1516-0. Physica, Heidelberg Google Scholar
  8. 8.
    Elmaghraby SE (1995) Activity nets: A guided tour through some recent developments. Eur J Oper Res 82:383–408 zbMATHCrossRefGoogle Scholar
  9. 9.
    Hartmann S, Drexl A (1998) Project scheduling with multiple modes: A comparison of exact algorithms. Networks 32:283–298 zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Heilmann R (2003) A branch-and-bound procedure for the multi-mode resource constrained project scheduling problem with minimum and maximum time lags. Eur J Oper Res 144:348–365 zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Kolisch R, Sprecher A, Drexl A (1995) Characterization and generation of a general class of resource-constrained project scheduling problems. Manag Sci 41:1693–1703 zbMATHCrossRefGoogle Scholar
  12. 12.
    Neumann K, Schwindt C, Zimmermann J (2003) Project scheduling with time windows and scarce resources, ISBN 3-540-40125-3. Springer, Berlin zbMATHGoogle Scholar
  13. 13.
    Schwindt C (1998) Generation of resource-constrained project scheduling problems subject to temporal constraints. Report WIOR-543, University of Karlsruhe Google Scholar
  14. 14.
    Seyed-Hosseini SM, Sabzehparvar M (2007) A geometrical model for the multi-mode resource constrained project scheduling problem. In: Business research conference for international academy of business disciplines, Florida, USA Google Scholar
  15. 15.
    Sprecher A, Drexl A (1998) Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm. Eur J Oper Res 107:431–450 zbMATHCrossRefGoogle Scholar
  16. 16.
    Talbot FB (1982) Resource-constrained project scheduling problem with time-resource trade-offs: the nonpreemptive case. Manag Sci 28:1197–1210 zbMATHGoogle Scholar

Copyright information

© The Author(s) 2007

Authors and Affiliations

  • Majid Sabzehparvar
    • 1
  • S. Mohammad Seyed-Hosseini
    • 1
  1. 1.Department of Industrial EngineeringIran University of Science and TechnologyTehranIran

Personalised recommendations