Solving resource-constrained multiple project scheduling problem using timed colored Petri nets

DOI10.1007/S12204-009-0713-ZzbMath1202.90147OpenAlexW1991236848MaRDI QIDQ615286

Guohui Song, Cong-Xin Li, Xin-Cun Zhuang, Yu Wu, Xiaodong Xu

Publication date: 5 January 2011

Published in: Journal of Shanghai Jiaotong University (Science) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12204-009-0713-z

zbMATH Keywords

timed colored Petri netsmapping mechanismresource-constrained multiple project scheduling problem (RCMPSP)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Analysis of scheduling schemes and heuristic rules performance in resource-constrained multiproject scheduling

This page was built for publication: Solving resource-constrained multiple project scheduling problem using timed colored Petri nets