![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Tom Servranckx
Person information
Refine list
![note](https://dblp.uni-trier.de./img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
- [j11]Xin Guan, Tom Servranckx, Mario Vanhoucke
:
Risk response budget allocation based on fault tree analysis and optimization. Ann. Oper. Res. 337(2): 523-564 (2024) - [j10]Tom Servranckx, José Coelho, Mario Vanhoucke:
Project management and scheduling 2022. Ann. Oper. Res. 338(1): 1-12 (2024) - [j9]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) - 2023
- [j8]Rojin Nekoueian
, Tom Servranckx
, Mario Vanhoucke
:
Constructive heuristics for selecting and scheduling alternative subgraphs in resource-constrained projects. Comput. Ind. Eng. 182: 109399 (2023) - 2022
- [j7]Humyun Fuad Rahman, Tom Servranckx, Ripon K. Chakrabortty, Mario Vanhoucke
, Sondoss El Sawah:
Manufacturing project scheduling considering human factors to minimize total cost and carbon footprints. Appl. Soft Comput. 131: 109764 (2022) - [j6]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
- [j5]Xin Guan, Tom Servranckx, Mario Vanhoucke:
An analytical model for budget allocation in risk prevention and risk protection. Comput. Ind. Eng. 161: 107657 (2021) - [j4]Tom Servranckx, Mario Vanhoucke
, Tarik Aouam
:
Practical application of reference class forecasting for cost and time estimations: Identifying the properties of similarity. Eur. J. Oper. Res. 295(3): 1161-1179 (2021) - 2020
- [j3]Tom Servranckx, Mario Vanhoucke
, Giel Vanhouwaert:
Analysing the impact of alternative network structures on resource-constrained schedules: Artificial and empirical experiments. Comput. Ind. Eng. 148: 106706 (2020) - 2019
- [j2]Tom Servranckx, Mario Vanhoucke
:
A tabu search procedure for the resource-constrained project scheduling problem with alternative subgraphs. Eur. J. Oper. Res. 273(3): 841-860 (2019) - [j1]Tom Servranckx
, Mario Vanhoucke
:
Strategies for project scheduling with alternative subgraphs under uncertainty: similar and dissimilar sets of schedules. Eur. J. Oper. Res. 279(1): 38-53 (2019)
Conference and Workshop Papers
- 2020
- [c1]Jie Song, Tom Servranckx, Annelies Martens, Mario Vanhoucke:
A Simulation Study on the Impact of Activity Crashing on the Project Duration and Cost under Different Budget Release Scenarios. FedCSIS 2020: 603-606
Coauthor Index
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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-08-06 22:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint