default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOnur Ozturk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Sajjad Dehnoei
, Antoine Sauré, Onur Ozturk, William Gardner, Kathleen Pajer, Roxanna Sheppard, Jonathan Patrick:
A stochastic optimization approach for staff scheduling decisions at inpatient units. Int. Trans. Oper. Res. 31(3): 1762-1790 (2024)- [c5]Onur Ozturk, Najat Bara:
An initial framework for the less-than-truckload problem: order allocation and planning. CoDIT 2024: 1068-1071 - 2022
- [j9]Onur Ozturk:
When serial batch scheduling involves parallel batching decisions: A branch and price scheme. Comput. Oper. Res. 137: 105514 (2022) - 2020
- [j8]Onur Ozturk:
A bi-criteria optimization model for medical device sterilization. Ann. Oper. Res. 293(2): 809-831 (2020) - [j7]Onur Ozturk:
A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time. Eur. J. Oper. Res. 286(2): 432-443 (2020) - [i1]Amirhossein Moosavi, Onur Ozturk:
Metaheuristics for the operating theater planning and scheduling: A systematic review. CoRR abs/2008.04970 (2020)
2010 – 2019
- 2018
- [j6]Onur Ozturk, Jonathan Patrick:
An optimization model for freight transport using urban rail transit. Eur. J. Oper. Res. 267(3): 1110-1121 (2018) - [j5]Onur Ozturk, Chengbin Chu:
Exact and metaheuristic algorithms to minimize the total tardiness of cutting tool sharpening operations. Expert Syst. Appl. 95: 224-235 (2018) - 2017
- [j4]Onur Ozturk, Mehmet A. Begen, Gregory S. Zaric:
A branch and bound algorithm for scheduling unit size jobs on parallel batching machines to minimize makespan. Int. J. Prod. Res. 55(6): 1815-1831 (2017) - 2016
- [c4]Sahin Yildirim, Erdem Arslan, Onur Ozturk:
Expandable range communication infrastructure for robot colonies. SIU 2016: 117-120 - 2015
- [j3]Onur Ozturk, Nail Akar:
A novel queue-aware wireless link adaptation mechanism and its fixed-point analytical model. EURASIP J. Wirel. Commun. Netw. 2015: 248 (2015) - [c3]M. Devrim Tokcan, Onur Ozturk, Hakan Tuna:
MetTest: A Test Automation Framework for Development of a Point-To-Multipoint Radio. ICST 2015: 1-2 - [c2]Onur Ozturk, Nail Akar:
Analysis of an Adaptive Modulation and Coding scheme with HARQ for TCP traffic. WTS 2015: 1-6 - 2014
- [j2]Onur Ozturk, Nail Akar:
Workload-dependent queuing model of an AQM-controlled wireless router with TCP traffic and its application to PER-based link adaptation. EURASIP J. Wirel. Commun. Netw. 2014: 67 (2014) - [j1]Onur Ozturk, Mehmet A. Begen, Gregory S. Zaric:
A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services. Eur. J. Oper. Res. 239(1): 214-226 (2014) - 2012
- [c1]Onur Ozturk, Orhan Arikan, A. Enis Çetin:
Empirical Mode Decomposition aided by adaptive low pass filtering. SIU 2012: 1-4
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-11-13 23:49 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:
