IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v186y2011i1p395-40610.1007-s10479-010-0776-0.html
   My bibliography  Save this article

Effort estimates through project complexity

Author

Listed:
  • Manuel Castejón-Limas
  • Joaquín Ordieres-Meré
  • Ana González-Marcos
  • Víctor González-Castro

Abstract

This paper reports the results obtained from use of project complexity parameters in modeling effort estimates. It highlights the attention that complexity has recently received in the project management area. After considering that traditional knowledge has consistently proved to be prone to failure when put into practice on actual projects, the paper endorses the belief that there is a need for more open-minded and novel approaches to project management. With a view to providing some insight into the opportunities that integrate complexity concepts into model building offers, we extend the work previously undertaken on the complexity dimension in project management. We do so analyzing the results obtained with classical linear models and artificial neural networks when complexity is considered as another managerial parameter. For that purpose, we have used the International Software Benchmarking Standards Group data set. The results obtained proved the benefits of integrating the complexity of the projects at hand into the models. They also addressed the need of a complex system, such as artificial neural networks, to capture the fine nuances of the complex systems to be modeled, the projects. Copyright Springer Science+Business Media, LLC 2011

Suggested Citation

  • Manuel Castejón-Limas & Joaquín Ordieres-Meré & Ana González-Marcos & Víctor González-Castro, 2011. "Effort estimates through project complexity," Annals of Operations Research, Springer, vol. 186(1), pages 395-406, June.
    • Handle: RePEc:spr:annopr:v:186:y:2011:i:1:p:395-406:10.1007/s10479-010-0776-0
    DOI: 10.1007/s10479-010-0776-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-010-0776-0
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-010-0776-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Petya Ivanova & Todor Tagarev, 2000. "Indicator space configuration for early warning of violent political conflicts by genetic algorithms," Annals of Operations Research, Springer, vol. 97(1), pages 287-311, December.
    2. Martin Schwardt & Kathrin Fischer, 2009. "Combined location-routing problems—a neural network approach," Annals of Operations Research, Springer, vol. 167(1), pages 253-269, March.
    3. Dušan Teodorović & Vijay Varadarajan & Jovan Popović & Mohan Chinnaswamy & Sharath Ramaraj, 2006. "Dynamic programming—neural network real-time traffic adaptive signal control algorithm," Annals of Operations Research, Springer, vol. 143(1), pages 123-131, March.
    4. Ishai Menache & Shie Mannor & Nahum Shimkin, 2005. "Basis Function Adaptation in Temporal Difference Reinforcement Learning," Annals of Operations Research, Springer, vol. 134(1), pages 215-238, February.
    5. Stavros Perantonis & Nikolaos Ampazis & Vassilis Virvilis, 2000. "A Learning Framework for Neural Networks Using Constrained Optimization Methods," Annals of Operations Research, Springer, vol. 99(1), pages 385-401, December.
    6. Tianshi Jiao & Jiming Peng & Tamás Terlaky, 2009. "A confidence voting process for ranking problems based on support vector machines," Annals of Operations Research, Springer, vol. 166(1), pages 23-38, February.
    7. Paul Kainen & Věra Kůrková & Andrew Vogt, 2001. "Continuity of Approximation by Neural Networks in Lp Spaces," Annals of Operations Research, Springer, vol. 101(1), pages 143-147, January.
    8. Joanna Józefowska & Marek Mika & Rafał Różycki & Grzegorz Waligóra & Jan Węglarz, 2001. "Simulated Annealing for Multi-Mode Resource-Constrained Project Scheduling," Annals of Operations Research, Springer, vol. 102(1), pages 137-155, February.
    9. G. Hao & K.K. Lai & M. Tan, 2004. "A Neural Network Application in Personnel Scheduling," Annals of Operations Research, Springer, vol. 128(1), pages 65-90, April.
    10. Clift, Thomas B. & Vandenbosch, Mark B., 1999. "Project Complexity and Efforts to Reduce Product Development Cycle Time," Journal of Business Research, Elsevier, vol. 45(2), pages 187-198, June.
    11. K. Thangavel & D. Kumar, 2006. "Optimization of code book in vector quantization," Annals of Operations Research, Springer, vol. 143(1), pages 317-325, March.
    12. Chris Charalambous & Andreas Charitou & Froso Kaourou, 2000. "Comparative Analysis of Artificial Neural Network Models: Application in Bankruptcy Prediction," Annals of Operations Research, Springer, vol. 99(1), pages 403-425, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. D. Laurie Hughes & Nripendra P. Rana & Yogesh K. Dwivedi, 2020. "Elucidation of IS project success factors: an interpretive structural modelling approach," Annals of Operations Research, Springer, vol. 285(1), pages 35-66, February.
    2. Aidin Delgoshaei & Timon Rabczuk & Ahad Ali & Mohd Khairol Anuar Ariffin, 2017. "An applicable method for modifying over-allocated multi-mode resource constraint schedules in the presence of preemptive resources," Annals of Operations Research, Springer, vol. 259(1), pages 85-117, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Luis F. Machado-Domínguez & Carlos D. Paternina-Arboleda & Jorge I. Vélez & Agustin Barrios-Sarmiento, 2021. "A memetic algorithm to address the multi-node resource-constrained project scheduling problem," Journal of Scheduling, Springer, vol. 24(4), pages 413-429, August.
    2. Emilio Carrizosa & Belen Martin-Barragan, 2011. "Maximizing upgrading and downgrading margins for ordinal regression," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 74(3), pages 381-407, December.
    3. Ranjbar, Mohammad & De Reyck, Bert & Kianfar, Fereydoon, 2009. "A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling," European Journal of Operational Research, Elsevier, vol. 193(1), pages 35-48, February.
    4. Qingzhu Yao & Xiaoyan Zhu & Way Kuo, 2014. "A Birnbaum-importance based genetic local search algorithm for component assignment problems," Annals of Operations Research, Springer, vol. 212(1), pages 185-200, January.
    5. Beata Gavurova & Sylvia Jencova & Radovan Bacik & Marta Miskufova & Stanislav Letkovsky, 2022. "Artificial intelligence in predicting the bankruptcy of non-financial corporations," Oeconomia Copernicana, Institute of Economic Research, vol. 13(4), pages 1215-1251, December.
    6. du Jardin, Philippe, 2015. "Bankruptcy prediction using terminal failure processes," European Journal of Operational Research, Elsevier, vol. 242(1), pages 286-303.
    7. Korol, Tomasz, 2013. "Early warning models against bankruptcy risk for Central European and Latin American enterprises," Economic Modelling, Elsevier, vol. 31(C), pages 22-30.
    8. Alessandra Amendola & Marialuisa Restaino & Luca Sensini, 2010. "Variabile Selection in Forecasting Models for Corporate Bankruptcy," Working Papers 3_216, Dipartimento di Scienze Economiche e Statistiche, Università degli Studi di Salerno.
    9. Adler Haymans Manurung & Derwin Suhartono & Benny Hutahayan & Noptovius Halimawan, 2023. "Probability Bankruptcy Using Support Vector Regression Machines," Journal of Applied Finance & Banking, SCIENPRESS Ltd, vol. 13(1), pages 1-3.
    10. Slawomir Juszczyk & Rafal Balina, 2013. "Effectiveness of Polish and Foreign Disdcriminant Models," Diversity, Technology, and Innovation for Operational Competitiveness: Proceedings of the 2013 International Conference on Technology Innovation and Industrial Management,, ToKnowPress.
    11. Grzegorz Waligóra, 2016. "Comparative Analysis of Some Metaheuristics for Discrete-Continuous Project Scheduling with Activities of Identical Processing Rates," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(03), pages 1-32, June.
    12. Marvin L. King & David R. Galbreath & Alexandra M. Newman & Amanda S. Hering, 2020. "Combining regression and mixed-integer programming to model counterinsurgency," Annals of Operations Research, Springer, vol. 292(1), pages 287-320, September.
    13. V. Van Peteghem & M. Vanhoucke, 2008. "A Genetic Algorithm for the Multi-Mode Resource-Constrained Project Scheduling Problem," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 08/494, Ghent University, Faculty of Economics and Business Administration.
    14. Patrick Gerhards, 2020. "The multi-mode resource investment problem: a benchmark library and a computational study of lower and upper bounds," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(4), pages 901-933, December.
    15. Ilyes Abid & Rim Ayadi & Khaled Guesmi & Farid Mkaouar, 2022. "A new approach to deal with variable selection in neural networks: an application to bankruptcy prediction," Annals of Operations Research, Springer, vol. 313(2), pages 605-623, June.
    16. Ling Tang & Shuai Wang & Kaijian He & Shouyang Wang, 2015. "A novel mode-characteristic-based decomposition ensemble model for nuclear energy consumption forecasting," Annals of Operations Research, Springer, vol. 234(1), pages 111-132, November.
    17. Greta Falavigna, 2006. "Models for Default Risk Analysis: Focus on Artificial Neural Networks, Model Comparisons, Hybrid Frameworks," CERIS Working Paper 200610, CNR-IRCrES Research Institute on Sustainable Economic Growth - Torino (TO) ITALY - former Institute for Economic Research on Firms and Growth - Moncalieri (TO) ITALY.
    18. Gutjahr, Walter J., 2015. "Bi-Objective Multi-Mode Project Scheduling Under Risk Aversion," European Journal of Operational Research, Elsevier, vol. 246(2), pages 421-434.
    19. Nasrin Asgari & Mohsen Rajabi & Masoumeh Jamshidi & Maryam Khatami & Reza Zanjirani Farahani, 2017. "A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study," Annals of Operations Research, Springer, vol. 250(2), pages 279-308, March.
    20. Peteghem, Vincent Van & Vanhoucke, Mario, 2010. "A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 201(2), pages 409-418, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:186:y:2011:i:1:p:395-406:10.1007/s10479-010-0776-0. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.