default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJosé Coelho 0001
Person information
- affiliation: Ghent University, Belgium
- affiliation: Universidade Aberta, Lisbon, Portugal
Other persons with the same name
- José Coelho 0002
![[0000-0003-4108-8435]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0003-4108-8435")
(aka: José Baptista Coelho) — University of Lisbon, Portugal - José Coelho 0003 — Cork Technological Centre, Santa Maria de Lamas, Portugal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]Rob Van Eynde, Mario Vanhoucke, José Coelho:
Correction to: on the summary measures for the resource-constrained project scheduling problem. Ann. Oper. Res. 332(1): 1309 (2024)- [j21]Rob Van Eynde, Mario Vanhoucke, José Coelho:
On the summary measures for the resource-constrained project scheduling problem. Ann. Oper. Res. 337(2): 593-625 (2024) - [j20]Tom Servranckx, José Coelho, Mario Vanhoucke:
Project management and scheduling 2022. Ann. Oper. Res. 338(1): 1-12 (2024) - [j19]Mario Vanhoucke, José Coelho:
Reducing the feasible solution space of resource-constrained project instances. Comput. Oper. Res. 165: 106567 (2024) - [j18]Tom Servranckx, José Coelho, Mario Vanhoucke:
A genetic algorithm for the Resource-Constrained Project Scheduling Problem with Alternative Subgraphs using a boolean satisfiability solver. Eur. J. Oper. Res. 316(3): 815-827 (2024) - [j17]Mario Vanhoucke, José Coelho:
A matheuristic for the resource-constrained project scheduling problem. Eur. J. Oper. Res. 319(3): 711-725 (2024) - 2023
- [j16]José Coelho, Mario Vanhoucke:
New resource-constrained project scheduling instances for testing (meta-)heuristic scheduling algorithms. Comput. Oper. Res. 153: 106165 (2023) - [j15]Weikang Guo, Mario Vanhoucke, José Coelho:
A prediction model for ranking branch-and-bound procedures for the resource-constrained project scheduling problem. Eur. J. Oper. Res. 306(2): 579-595 (2023) - [j14]Jingyu Luo, Mario Vanhoucke, José Coelho:
Automated design of priority rules for resource-constrained project scheduling problem using surrogate-assisted genetic programming. Swarm Evol. Comput. 81: 101339 (2023) - 2022
- [j13]Jingyu Luo, Mario Vanhoucke, José Coelho, Weikang Guo:
An efficient genetic programming approach to design priority rules for resource-constrained project scheduling problem. Expert Syst. Appl. 198: 116753 (2022) - [j12]Tom Servranckx, José Coelho, Mario Vanhoucke:
Various extensions in resource-constrained project scheduling with alternative subgraphs. Int. J. Prod. Res. 60(11): 3501-3520 (2022) - 2021
- [j11]Mario Vanhoucke, José Coelho:
An analysis of network and resource indicators for resource-constrained project scheduling problem instances. Comput. Oper. Res. 132: 105260 (2021) - [j10]Weikang Guo, Mario Vanhoucke, José Coelho, Jingyu Luo:
Automatic detection of the best performing priority rule for the resource-constrained project scheduling problem. Expert Syst. Appl. 167: 114116 (2021) - 2020
- [j9]José Coelho, Mario Vanhoucke:
Going to the core of hard resource-constrained project scheduling instances. Comput. Oper. Res. 121: 104976 (2020)
2010 – 2019
- 2019
- [j8]Mario Vanhoucke, José Coelho:
Resource-constrained project scheduling with activity splitting and setup times. Comput. Oper. Res. 109: 230-249 (2019) - [c1]Hugo Canossa, José Coelho, Fernando Faria Paulino:
Clash (and dance) Yourself. ARTECH 2019: 51:1-51:7 - 2018
- [j7]Mario Vanhoucke, José Coelho:
A tool to test and validate algorithms for the resource-constrained project scheduling problem. Comput. Ind. Eng. 118: 251-265 (2018) - [j6]José Coelho, Mario Vanhoucke:
An exact composite lower bound strategy for the resource-constrained project scheduling problem. Comput. Oper. Res. 93: 135-150 (2018) - 2017
- [j5]Rui Manuel Agostinho Gaspar, José Pedro Fernandes da Silva Coelho, Glória Maria Lourenço Bastos:
Prazerosa - Interactive Reading Chair. Int. J. Creative Interfaces Comput. Graph. 8(2): 1-12 (2017) - 2016
- [j4]Mario Vanhoucke, José Coelho:
An approach using SAT solvers for the RCPSP with logical constraints. Eur. J. Oper. Res. 249(2): 577-591 (2016) - 2015
- [j3]Veronique Sels, José Coelho, António Manuel Dias, Mario Vanhoucke:
Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem. Comput. Oper. Res. 53: 107-117 (2015) - 2011
- [j2]José Coelho, Mario Vanhoucke:
Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers. Eur. J. Oper. Res. 213(1): 73-82 (2011)
2000 – 2009
- 2008
- [j1]Mario Vanhoucke, José Coelho, Dieter Debels, Broos Maenhout, Luís Valadares Tavares:
An evaluation of the adequacy of project network generators with systematically sampled networks. Eur. J. Oper. Res. 187(2): 511-524 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
