Cookies Policy
We use cookies to improve our site and your experience. By continuing to browse our site you accept our cookie policy. Find out More
Close
  • Menu
About
Download Photo HD

About

José Coelho holds a PhD in Systems Engineering from the Technical University of Lisbon in 2004. It is an Assistant Professor at the Open University in the Department of Science and Technology. Published 12 papers in international journals and more than 35 varied nature of resources in the open repository. In their professional activities interacted with 36 employees in co-authorships of scientific papers.

Interest
Topics
Details

Details

001
Publications

2019

A Study of the Critical Chain Project Management Method Applied to a Multiproject System

Authors
Cooper Ordonez, REC; Vanhoucke, M; Coelho, J; Anholon, R; Novaski, O;

Publication
Project Management Journal

Abstract
In 1997, Eliyahu Goldratt proposed a method called critical chain project management (CCPM) to minimize the inefficiencies identified in traditional project management. The project management community accepted the proposed method as a viable alternative. However, to allow its implementation with a multiproject system, more research was necessary. Seeking to identify the key factors that influence the performance of the multiproject system applying the CCPM method, we performed a case study. Logistic regression analysis showed that applying the CCPM method in a multiproject system allows for better time estimation of activities and facilitates the allocation of critical resources. © 2019 Project Management Institute, Inc.

2019

Resource-constrained project scheduling with activity splitting and setup times

Authors
Vanhoucke, M; Coelho, J;

Publication
Computers & Operations Research

Abstract

2018

An exact composite lower bound strategy for the resource-constrained project scheduling problem

Authors
Coelho, J; Vanhoucke, M;

Publication
Computers and Operations Research

Abstract
This paper reports on results for the well-known resource-constrained project scheduling problem. A branch-and-bound procedure is developed that takes into account all best performing components from literature, varying branching schemes and search strategies, using the best performing dominance rules and assembling these components into a unified search algorithm. A composite lower bound strategy that statically and dynamically selects the best performing bounds from literature is used to find optimal solutions within reasonable times. An extensive computational experiment is set up to determine the best combination of the various components used in the procedure, in order to benchmark the current existing knowledge on four different datasets from the literature. By varying the network topology, resource scarceness and the size of the projects, the computational experiments are carried out on a diverse set of projects. The procedure was able to find some new lower bounds and optimal solutions for the PSPLIB instances. Moreover, new best known results are reported for other, more diverse datasets that can be used in future research studies. The experiments revealed that even project instances with 30 activities cannot be solved to optimality when the topological structure is varied. © 2018 Elsevier Ltd

2018

A tool to test and validate algorithms for the resource-constrained project scheduling problem

Authors
Vanhoucke, M; Coelho, J;

Publication
Computers and Industrial Engineering

Abstract
In a paper written by by Vanhoucke et al. (2016), an overview of artificial and empirical project databases has been given for integrated project management and control. These databases are collections of the most well-known and widespread data instances available in literature for the construction of a baseline schedule, the analysis of schedule risk or the use for project control. The current paper serves as a follow-up study to further elaborate on the use of these data instances, and to give researchers an incentive to use these datasets for their research on the development and validation of new algorithms for project scheduling. Therefore, unlike the general focus of the previous paper on baseline scheduling, schedule risk analysis and project control, the focus on the current paper is restricted to resource-constrained project scheduling. The intention of this follow-up overview is fourfold. First and foremost, a procedure is proposed to facilitate the reporting of best known solutions for the well-known single- and multi-mode resource-constrained project scheduling problem to minimize the project makespan. Secondly, the paper reports our best known solutions we obtained so far, and reflects on the network and resource parameters that increase the project complexity. In doing so, areas to focus on for future research are detected, and an attempt to define hard problem instances is given. Thirdly, a new dataset is presented for the resource-constrained project scheduling problem that is much more diverse in both the network topology and resource scarceness and will enable the future researcher to develop algorithms to solve a wider range of project problems. Finally, the paper also adds some links to tutorials and other relevant information to stimulate researchers to download the data and update best known solutions once available. © 2018 Elsevier Ltd

2017

Prazerosa – Interactive Reading Chair

Authors
Gaspar, RMA; Coelho, JPFdS; Bastos, GML;

Publication
International Journal of Creative Interfaces and Computer Graphics

Abstract