default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Creemers
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]Salim Rostami, Stefan Creemers
, Roel Leus:
Maximizing the net present value of a project under uncertainty: Activity delays and dynamic policies. Eur. J. Oper. Res. 317(1): 16-24 (2024)- [j21]Stephanie Beyer Díaz, Kristof Coussement, Arno De Caigny, Luis Fernando Pérez, Stefan Creemers:
Do the US president's tweets better predict oil prices? An empirical examination using long short-term memory networks. Int. J. Prod. Res. 62(6): 2158-2175 (2024) - 2022
- [j20]Stefan Creemers, Robert N. Boute:
The joint replenishment problem: Optimal policy and exact evaluation method. Eur. J. Oper. Res. 302(3): 1175-1188 (2022) - 2021
- [j19]Maud Van den Broeke, Bart Devoldere, Stefan Creemers, Robert N. Boute:
Product platform replacement: impact of performance objectives, innovation speed, and competition. Int. J. Technol. Manag. 85(1): 21-41 (2021)
2010 – 2019
- 2019
- [j18]Salim Rostami, Stefan Creemers, Roel Leus:
Precedence theorems and dynamic programming for the single-machine weighted tardiness problem. Eur. J. Oper. Res. 272(1): 43-49 (2019) - [j17]Salim Rostami, Stefan Creemers, Wenchao Wei, Roel Leus:
Sequential testing of n-out-of-n systems: Precedence theorems and exact methods. Eur. J. Oper. Res. 274(3): 876-885 (2019) - [j16]Stefan Creemers:
The preemptive stochastic resource-constrained project scheduling problem. Eur. J. Oper. Res. 277(1): 238-247 (2019) - 2018
- [j15]Stefan Creemers:
Maximizing the expected net present value of a project with phase-type distributed activity durations: An efficient globally optimal solution procedure. Eur. J. Oper. Res. 267(1): 16-22 (2018) - [j14]Stefan Creemers:
Moments and distribution of the net present value of a serial project. Eur. J. Oper. Res. 267(3): 835-848 (2018) - [j13]Philipp Melchiors, Roel Leus, Stefan Creemers, Rainer Kolisch:
Dynamic order acceptance and capacity planning in a stochastic multi-project environment with a bottleneck resource. Int. J. Prod. Res. 56(1-2): 459-475 (2018) - [j12]Salim Rostami, Stefan Creemers, Roel Leus:
New strategies for stochastic resource-constrained project scheduling. J. Sched. 21(3): 349-365 (2018) - 2017
- [j11]Silvia Valeria Padilla Tinoco, Stefan Creemers, Robert N. Boute:
Collaborative shipping under different cost-sharing agreements. Eur. J. Oper. Res. 263(3): 827-837 (2017) - [j10]Stefan Creemers, Gert Woumans, Robert N. Boute, Jeroen Beliën:
Tri-Vizor Uses an Efficient Algorithm to Identify Collaborative Shipping Opportunities. Interfaces 47(3): 244-259 (2017) - [c4]Xiaoming Wang, Roel Leus, Stefan Creemers, Qingxin Chen, Ning Mao:
A CTMDP-Based Exact Method for RCPSP with Uncertain Activity Durations and Rework. OR 2017: 559-565 - 2016
- [j9]Gert Woumans, Liesje De Boeck, Jeroen Beliën, Stefan Creemers:
A column generation approach for solving the examination-timetabling problem. Eur. J. Oper. Res. 253(1): 178-194 (2016) - 2015
- [j8]Stefan Creemers, Bert De Reyck, Roel Leus:
Project planning with alternative technologies in uncertain environments. Eur. J. Oper. Res. 242(2): 465-476 (2015) - [j7]Stefan Creemers:
Minimizing the expected makespan of a project with stochastic activity durations under resource constraints. J. Sched. 18(3): 263-273 (2015) - [c3]Roel Leus, Salim Rostami, Stefan Creemers:
New benchmark results for the stochastic resource-constrained project scheduling problem. IEEM 2015: 204-208 - 2014
- [j6]Stefan Creemers, Erik Demeulemeester, Stijn Van de Vonder:
A new approach for quantitative risk analysis. Ann. Oper. Res. 213(1): 27-65 (2014) - [j5]Stefan Creemers, Mieke Defraeye, Inneke Van Nieuwenhuyse:
G-RAND: A phase-type approximation for the nonstationary G(t)/G(t)/s(t)+G(t) queue. Perform. Evaluation 80: 102-123 (2014) - [c2]Stefan Creemers:
The resource-constrained project scheduling problem with stochastic activity durations. IEEM 2014: 453-457 - 2012
- [j4]Stefan Creemers, Jeroen Beliën, Marc Lambrecht:
The optimal allocation of server time slots over different classes of patients. Eur. J. Oper. Res. 219(3): 508-521 (2012) - 2011
- [c1]Stefan Creemers, Erik Demeulemeester, Stijn Van de Vonder:
Project risk management: A new approach. IEEM 2011: 839-843 - 2010
- [j3]Stefan Creemers, Marc Lambrecht:
Queueing models for appointment-driven systems. Ann. Oper. Res. 178(1): 155-172 (2010) - [j2]Stefan Creemers, Roel Leus, Marc Lambrecht:
Scheduling Markovian PERT networks to maximize the net present value. Oper. Res. Lett. 38(1): 51-56 (2010)
2000 – 2009
- 2009
- [j1]Stefan Creemers, Marc Lambrecht:
An advanced queueing model to analyze appointment-driven service systems. Comput. Oper. Res. 36(10): 2773-2785 (2009)
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-08-05 20:25 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:
