default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPieter Smet
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i2]Martina Doneda, Pieter Smet, Giuliana Carello, Ettore Lanzarone, Greet Vanden Berghe:
Robust personnel rostering: how accurate should absenteeism predictions be? CoRR abs/2406.18119 (2024)- 2023
- [j18]Vincent Derkinderen
, Jessa Bekker, Pieter Smet:
Optimizing workforce allocation under uncertain activity duration. Comput. Ind. Eng. 179: 109228 (2023) - [i1]Carlo S. Sartori, Pieter Smet, Greet Vanden Berghe:
Models and algorithms for simple disjunctive temporal problems. CoRR abs/2302.02644 (2023) - 2022
- [j17]Federico Mosquera, Pieter Smet, Greet Vanden Berghe:
An Algorithm for Generating a Diverse Set of Multi-Modal Journeys. Algorithms 15(11): 416 (2022) - [j16]Carlo S. Sartori, Pieter Smet, Greet Vanden Berghe:
Truck driver scheduling with interdependent routes and working time constraints. EURO J. Transp. Logist. 11: 100092 (2022) - [j15]Carlo S. Sartori, Pieter Smet, Greet Vanden Berghe:
Scheduling truck drivers with interdependent routes under European Union regulations. Eur. J. Oper. Res. 298(1): 76-88 (2022) - [c4]Vinícius Gandra, Carlo S. Sartori, Hatice Çalik, Pieter Smet:
Multi-depot periodic vehicle routing with variable visit patterns. GECCO Companion 2022: 2019-2026 - 2021
- [j14]Pieter Smet:
Vehicle substitution in heterogeneous round-trip carsharing systems. Comput. Ind. Eng. 162: 107703 (2021) - [j13]Elín Björk Böðvarsdóttir, Pieter Smet, Greet Vanden Berghe, Thomas J. R. Stidsen:
Achieving compromise solutions in nurse rostering by using automatically estimated acceptance thresholds. Eur. J. Oper. Res. 292(3): 980-995 (2021) - [j12]Reshma Chirayil Chandrasekharan, Pieter Smet, Tony Wauters:
An automatic constructive matheuristic for the shift minimization personnel task scheduling problem. J. Heuristics 27(1-2): 205-227 (2021) - [j11]Pieter Smet:
Ride sharing with flexible participants: a metaheuristic approach for large-scale problems. Int. Trans. Oper. Res. 28(1): 91-118 (2021) - [j10]Toni Ismael Wickert, Pieter Smet, Greet Vanden Berghe:
Quantifying and enforcing robustness in staff rostering. J. Sched. 24(3): 347-366 (2021) - [c3]Carlo S. Sartori, Pieter Smet, Greet Vanden Berghe:
Efficient Duration-Based Workload Balancing for Interdependent Vehicle Routes. ATMOS 2021: 1:1-1:15 - [c2]Carlo S. Sartori, Vinícius Gandra, Hatice Çalik, Pieter Smet:
Production Scheduling with Stock- and Staff-Related Restrictions. ICCL 2021: 142-162 - [c1]Pieter Smet, Emmanouil Thanos, Federico Mosquera, Toni Ismael Wickert:
Algorithms for the Design of Round-Trip Carsharing Systems with a Heterogeneous Fleet. ICCL 2021: 362-376
2010 – 2019
- 2019
- [j9]Toni Ismael Wickert, Pieter Smet, Greet Vanden Berghe:
The nurse rerostering problem: Strategies for reconstructing disrupted schedules. Comput. Oper. Res. 104: 319-337 (2019) - 2017
- [j8]Pieter Smet, Fabio Salassa, Greet Vanden Berghe:
Local and global constraint consistency in personnel rostering. Int. Trans. Oper. Res. 24(5): 1099-1117 (2017) - 2016
- [j7]Pieter Smet:
Nurse rostering: models and algorithms for theory, practice and integration with other problems. 4OR 14(3): 327-328 (2016) - [j6]Pieter Smet, Andreas T. Ernst, Greet Vanden Berghe:
Heuristic decomposition approaches for an integrated task scheduling and personnel rostering problem. Comput. Oper. Res. 76: 60-72 (2016) - [j5]Pieter Smet, Peter Brucker, Patrick De Causmaecker, Greet Vanden Berghe:
Polynomially solvable personnel rostering problems. Eur. J. Oper. Res. 249(1): 67-75 (2016) - [j4]Tony Wauters, Joris Kinable, Pieter Smet, Wim Vancroonenburg, Greet Vanden Berghe, Jannes Verstichel:
The Multi-Mode Resource-Constrained Multi-Project Scheduling Problem - The MISTA 2013 challenge. J. Sched. 19(3): 271-283 (2016) - 2015
- [b1]Pieter Smet:
Nurse rostering: models and algorithms for theory, practice and integration with other problems ; Personeelsplanning in de gezondheidszorg: modellen en algoritmen voor de theorie, praktijk en integratie met andere problemen. Katholieke Universiteit Leuven, Belgium, 2015 - [j3]Mustafa Misir, Pieter Smet, Greet Vanden Berghe:
An analysis of generalised heuristics for vehicle routing and personnel rostering problems. J. Oper. Res. Soc. 66(5): 858-870 (2015) - 2014
- [j2]Pieter Smet, Burak Bilgin, Patrick De Causmaecker, Greet Vanden Berghe:
Modelling and evaluation issues in nurse rostering. Ann. Oper. Res. 218(1): 303-326 (2014) - 2013
- [j1]Simon Martin, Djamila Ouelhadj, Pieter Smet, Greet Vanden Berghe, Ender Özcan:
Cooperative search for fair nurse rosters. Expert Syst. Appl. 40(16): 6674-6683 (2013) - [p1]Pieter Smet, Patrick De Causmaecker, Burak Bilgin, Greet Vanden Berghe:
Nurse Rostering: A Complex Example of Personnel Scheduling with Perspectives. Automated Scheduling and Planning 2013: 129-153
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 2025-01-20 23:02 CET 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:
