Consolidation of the IFM with the JSSP through Neural Networks as Model for Software Projects

Ipsilandis, Pandelis; Tselios, Dimitrios; Gerogiannis, Vassilis C.

doi:10.1109/aims.2014.16

Cited by 2 publications

(1 citation statement)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A statistical approach is proposed, for example, in [13] that has polynomial complexity and results in approximation schedules with an arbitrarily chosen degree of confidence. Recently, Ipsilandis et al [14] tried to define an IFM project in terms of the Job Shop Scheduling Problem (JSSP), showing that JSSP can be utilised within the framework of IFM to address multiple projects sharing constrained resources.…”

Section: Overview Of Related Workmentioning

confidence: 99%

A dynamic programming algorithm for optimizing the financial return of software projects

Tselios

Ipsilandis

Gerogiannis

2015

2015 6th International Conference on Information, Intelligence, Systems and Applications (IISA)

Self Cite

View full text Add to dashboard Cite

The Incremental Funding Method (IFM) in software development projects aims at optimizing the financial return of a software project through proper sequencing of development activities and incremental releases of the software product. This paper presents a Dynamic Programming (DP) project scheduling algorithm that maximizes a software project's net present value (NPV) under IFM assumptions. Through an exemplar case study we demonstrate that the DP algorithm guarantees optimality in the project scheduling sequence and offers flexibility in adjusting the optimum project schedule dynamically, as market or development conditions change.

show abstract

Section: Overview Of Related Workmentioning

confidence: 99%