Abstract
This work proposes an extended Petri-Nets for resource constrained project scheduling problem (RCPSP). Several important issues about Petri-Nets on RCPSP are discussed in this paper. Firstly, the most important elements in Petri-Nets on RCPSP, including waiting place, activity place, resource place and final place, are designed. At the same time, three kinds of transitions are designed. They are coordination transition, resource allocating transition and resource releasing transition. Secondly, the Petri-Nets are improved according to the varying with increase or decrease of the number of resource acquisition. In this extended Petri-net, for the foremost difference with conventional Petri-Nets is to add a place and replace a releasing transition by the delaying transition and the firing rules of transition. Extensive experiments are performed to evaluate the performances of the proposed Petri-Nets against the state-of-art algorithms. The simulation experimental results of difference sides showed that extended Petri-Nets provides a more efficient way to solve RCPSP and produces competitive results compared with other methods investigated in this works.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hartmann, S.: A self-adapting genetic algorithm for project scheduling under resource constraints. Naval Research Logistics 49, 433–448 (2002)
Verhoeven, M.G.A.: Tabu search for resource constrained scheduling. Eur. J. Oper. Res. 106, 266–276 (1998)
Hu, W., Liang, H., Peng, C., Du, B., Hu, Q.: A Hybrid Chaos-Particle Swarm Optimization Algorithm for the Vehicle Routing Problem with Time Window. Entropy 15, 1247–1270 (2013)
Ziarati, K.: On the performance of bee algorithms for resource-constrained project scheduling problem. Applied Soft Computing 11, 3720–3733 (2011)
Gradisar, D., Music, G.: Production-process modeling based on production-management data: A Petri-net approach. International Journal of Computer Integrated Manufacturing 20, 794–810 (2007)
Ramirez-Trevino, A., Ruiz-Beltran, E., Rivera-Rangel, I., Lopez-Mellado, E.: Online fault diagnosis of discrete event systems. IEEE Transactions on Automation Science and Engineering 4, 31–39 (2007)
Ding, Z., Bunke, H., Kipersztok, O., Schneider, M., Kandel, A.: Fuzzy timed Petri nets-analysis and implementation. Mathematical and Computer Modelling 43, 385–400 (2006)
Project Scheduling Problem Library- PSPLIB, http://129.187.106.231/psplib
Bouleimen, K., Lecocq, H.: A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. European Journal of Operational Research 149, 268–281 (2003)
Baar, T., Brucker, P., Knust, S.: Tabu search algorithm and lower bounds for the resource-constrained project scheduling problem. In: Meta-heuristics: Advanced and Trends in Local Search Paradigms for Optimization. Klumer, Dordrecht (1998)
Chen, W., Shi, Y.J., Teng, H.F., Lan, X.P., Hu, L.C.: An efficient hybrid algorithm for resource-constrained project scheduling. Information Science 180, 1031–1039 (2010)
Nonobe, K., Ibaraki, T.: Formulation and tabu search algorithm for the resource constrained project scheduling problem. In: Essays and Surveys in Metaheuristic. Kluwer Academic Publishers, Dordrecht (2002)
Kolisch, R.: Serial and parallel resource-constrained project scheduling methods revisite: Theory and computation. European Journal of Operational Research 90, 320–333 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Hu, W., Wang, H. (2014). A Novel Petri-Net Based Resource Constrained Multi-project Scheduling Method. In: Sun, Xh., et al. Algorithms and Architectures for Parallel Processing. ICA3PP 2014. Lecture Notes in Computer Science, vol 8630. Springer, Cham. https://doi.org/10.1007/978-3-319-11197-1_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-11197-1_21
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11196-4
Online ISBN: 978-3-319-11197-1
eBook Packages: Computer ScienceComputer Science (R0)