This tool contains traditional, agile, and hybrid project management planning, scheduling, and risk analysis techniques. The algorithms are based on the following papers:
First, please use DEMO.m
Implemented Scheduling Problems:
CTCTP: Continuous Time-Cost Trade-off Problem
DTCTP: Discrete Time-Cost Trade-off Problem
CTQCTP: Continuous Time-Quality-Cost Trade-off Problem
DTQCTP: Discrete Time-Quality-Cost Trade-off Problem
RC-CTCTP: Resource-Constrained Continuous Time-Cost Trade-off Problem
RC-DTCTP: Resource-Constrained Discrete Time-Cost Trade-off Problem
RC-CTQCTP: Resource-Constrained Continuous Time-Quality-Cost Trade-off Problem
RC-DTQCTP: Resource-Constrained Discrete Time-Quality-Cost Trade-off Problem
MRCPSP: Multimode Resource-Constrained Project Scheduling Problem
MRCPSP-Q: Multimode Resource-Constrained Project Scheduling Problem with Quality parameters
Agents:
TPMa: Traditional Project Management agent (see mtpma.m)
APMa: Agile Project Management agent (see mapma.m)
HPMa: Hybrid Project Management agent (see mhpma.m)
Kosztyán, Zsolt T. “An Exact Algorithm for the Flexible Multilevel Project Scheduling Problem.” Expert Systems with Applications, vol. 158, Elsevier BV, Nov. 2020, p. 113485, doi:10.1016/j.eswa.2020.113485.
Kosztyán, Zsolt T. “An Exact Algorithm for the Flexible Multilevel Project Scheduling Problem.” Expert Systems with Applications, vol. 158, Elsevier BV, Nov. 2020, p. 113485, doi:10.1016/j.eswa.2020.113485.
APA
Kosztyán, Z. T. (2020). An exact algorithm for the flexible multilevel project scheduling problem. Expert Systems with Applications, 158, 113485. Elsevier BV. Retrieved from https://doi.org/10.1016%2Fj.eswa.2020.113485
BibTeX
@article{Koszty_n_2020,
doi = {10.1016/j.eswa.2020.113485},
url = {https://doi.org/10.1016%2Fj.eswa.2020.113485},
year = 2020,
month = {nov},
publisher = {Elsevier {BV}},
volume = {158},
pages = {113485},
author = {Zsolt T. Koszty{\'{a}}n},
title = {An exact algorithm for the flexible multilevel project scheduling problem},
journal = {Expert Systems with Applications}
}
Kosztyán, Zsolt T., et al. Survive IT! Survival Analysis of IT Project Planning Approaches. Elsevier BV, 2020, p. 100170, doi:10.1016/j.orp.2020.100170.
Kosztyán, Zsolt T., et al. Survive IT! Survival Analysis of IT Project Planning Approaches. Elsevier BV, 2020, p. 100170, doi:10.1016/j.orp.2020.100170.
APA
Kosztyán, Z. T., Jakab, R., Novák, G., & Hegedűs, C. (2020). Survive IT! Survival analysis of IT project planning approaches, 7, 100170. Elsevier BV. Retrieved from https://doi.org/10.1016%2Fj.orp.2020.100170
BibTeX
@article{2020,
doi = {10.1016/j.orp.2020.100170},
url = {https://doi.org/10.1016%2Fj.orp.2020.100170},
year = 2020,
publisher = {Elsevier {BV}},
volume = {7},
pages = {100170},
author = {Zsolt T. Koszty{\'{a}}n and R{\'{o}}bert Jakab and Gergely Nov{\'{a}}k and Csaba Heged{\H{u}}s},
title = {Survive {IT}! Survival analysis of {IT} project planning approaches}
}
Kosztyán, Zsolt T., and István Szalkai. Multimode Resource-Constrained Project Scheduling in Flexible Projects. no. 1, Springer Science and Business Media LLC, Oct. 2019, pp. 211–41, doi:10.1007/s10898-019-00832-8.
Kosztyán, Zsolt T., and István Szalkai. Multimode Resource-Constrained Project Scheduling in Flexible Projects. no. 1, Springer Science and Business Media LLC, Oct. 2019, pp. 211–41, doi:10.1007/s10898-019-00832-8.
APA
Kosztyán, Z. T., & Szalkai, I. (2019). Multimode resource-constrained project scheduling in flexible projects, 76(1), 211–241. Springer Science and Business Media LLC. Retrieved from https://doi.org/10.1007%2Fs10898-019-00832-8
BibTeX
@article{2019,
doi = {10.1007/s10898-019-00832-8},
url = {https://doi.org/10.1007%2Fs10898-019-00832-8},
year = 2019,
month = {oct},
publisher = {Springer Science and Business Media {LLC}},
volume = {76},
number = {1},
pages = {211--241},
author = {Zsolt T. Koszty{\'{a}}n and Istv{\'{a}}n Szalkai},
title = {Multimode resource-constrained project scheduling in flexible projects}
}
Kosztyán, Zsolt T. Exact Algorithm for Matrix-Based Project Planning Problems. no. 9, Elsevier BV, June 2015, pp. 4460–73, doi:10.1016/j.eswa.2015.01.066.
Kosztyán, Zsolt T. Exact Algorithm for Matrix-Based Project Planning Problems. no. 9, Elsevier BV, June 2015, pp. 4460–73, doi:10.1016/j.eswa.2015.01.066.
APA
Kosztyán, Z. T. (2015). Exact algorithm for matrix-based project planning problems, 42(9), 4460–4473. Elsevier BV. Retrieved from https://doi.org/10.1016%2Fj.eswa.2015.01.066
BibTeX
@article{2015,
doi = {10.1016/j.eswa.2015.01.066},
url = {https://doi.org/10.1016%2Fj.eswa.2015.01.066},
year = 2015,
month = {jun},
publisher = {Elsevier {BV}},
volume = {42},
number = {9},
pages = {4460--4473},
author = {Zsolt T. Koszty{\'{a}}n},
title = {Exact algorithm for matrix-based project planning problems}
}
Kosztyán, Zsolt T., and István Szalkai. Hybrid Time-Quality-Cost Trade-off Problems. Elsevier BV, 2018, pp. 306–18, doi:10.1016/j.orp.2018.09.003.
You can also select a web site from the following list
How to Get Best Site Performance
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
View License on GitHub
