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

DOI10.1007/S12204-009-0713-ZzbMATH Open1202.90147OpenAlexW1991236848MaRDI QIDQ615286FDOQ615286

Authors: Yu Wu, Xin-Cun Zhuang, Guohui Song, Xiaodong Xu, Congxin Li 

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

Recommendations

• Simplifying multiproject scheduling problem based on design structure matrix and its solution by an improved aiNet algorithm
• Research on multi-mode resource constrained project scheduling problem with discounted cash flows
• An improved ant algorithm for multi-mode resource constrained project scheduling problem
• Solving a multi-objective flexible job shop scheduling problem with timed Petri nets and genetic algorithm
• An integer programming approach to the multimode resource-constrained multiproject scheduling problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q615286)