Abstract
Over the last few decades, a number of mathematical models have been introduced for solving Multi-mode Resource Constrained Project Scheduling Problems (MRCPSPs). However the computational effort required in solving those models depends on the number of variables. In this paper, we attempt to reduce the number of variables required in representing MRCPSPs by formulating two new event-based models. A comparative study was conducted by solving standard benchmark instances using a common objective function for the developed as well as the existing mathematical models. The study provided interesting insights about the problem characteristics, model sizes, solution quality, and computational effort of these approaches.
Chapter PDF
Similar content being viewed by others
Keywords
References
Hartmann, S., Briskorn, D.: A survey of variants and extensions of the resource-constrained project scheduling problem. European Journal of Operational Research 207(1), 1–14 (2010)
Zapata, J.C., Hodge, B.M., Reklaitis, G.V.: The multimode resource constrained multiproject scheduling problem: Alternative formulations. AIChE Journal 54(8), 2101–2119 (2008)
Koné, O., Artigues, C., Lopez, P., Mongeau, M.: Comparison of mixed integer linear programming models for the resource-constrained project scheduling problem with consumption and production of resources. Flexible Services and Manufacturing Journal 25(1-2), 25–47 (2013)
Pritsker, A.A.B., Waiters, L.J., Wolfe, P.M.: Multiproject scheduling with limited resources: A zero-one programming approach. Management Science 16(1), 93–108 (1969)
Klein, R., Scholl, A.: Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling. European Journal of Operational Research 112(2), 322–346 (1999)
Lawler, E.L.: Combinatorial optimization: networks and matroids. Courier Dover Publications (1976)
Sabzehparvar, M., Seyed-Hosseini, S.M.: A mathematical model for the multi-mode resource-constrained project scheduling problem with mode dependent time lags. The Journal of Supercomputing 44(3), 257–273 (2007)
Herroelen, W., Leus, R.: Project scheduling under uncertainty: Survey and research potentials. European Journal of Operational Research 165(2), 289–306 (2005)
Alcaraz, J., Maroto, C., Ruiz, R.: Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with genetic algorithms. Journal of the Operational Research Society 54(6), 614–626 (2003)
Koné, O., Artigues, C., Lopez, P., Mongeau, M.: Event-based MILP models for resource-constrained project scheduling problems. Computers & Operations Research 38(1), 3–13 (2011)
Pinto, J., Grossmann, I.: A continuous time MILP model for short term scheduling of batch plants with pre-ordering constraints. Computers & Chemical Engineering, 20, S1197–S1202 (1996)
Lenstra Jr, H.W.: Integer programming with a fixed number of variables. Mathematics of Operations Research 8(4), 538–548 (1983)
Beşikçi, U., Bilge, Ü., Ulusoy, G.: Different resource management policies in multi-mode resource constrained multi-project scheduling. In: 2011 World Congress on Engineering and Technology, Shanghai, China (2011)
Talbot, F.B.: Resource-constrained project scheduling with time-resource tradeoffs: The nonpreemptive case. Management Science 28(10), 1197–1210 (1982)
Kolisch, R., Sprecher, A., Drexl, A.: Characterization and generation of a general class of resource-constrained project scheduling problems. Management Science 41(10), 1693–1703 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 IFIP International Federation for Information Processing
About this paper
Cite this paper
Chakrabortty, R.K., Sarker, R.A., Essam, D.L. (2014). Event Based Approaches for Solving Multi-mode Resource Constraints Project Scheduling Problem. In: Saeed, K., Snášel, V. (eds) Computer Information Systems and Industrial Management. CISIM 2015. Lecture Notes in Computer Science, vol 8838. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45237-0_35
Download citation
DOI: https://doi.org/10.1007/978-3-662-45237-0_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-45236-3
Online ISBN: 978-3-662-45237-0
eBook Packages: Computer ScienceComputer Science (R0)