default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOguzhan Ahmet Arik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
[j14]Oguzhan Ahmet Arik
:
Fuzzy rule-based variable neighborhood search algorithm for single-machine weighted earliness/tardiness scheduling with common due date. Neural Comput. Appl. 37(5): 3355-3371 (2025)- 2022
- [j13]Oguzhan Ahmet Arik, Marco Schutten, Engin Topan:
Weighted earliness/tardiness parallel machine scheduling problem with a common due date. Expert Syst. Appl. 187: 115916 (2022) - [j12]Oguzhan Ahmet Arik:
Fuzzy rule-based acceptance criterion in metaheuristic algorithms. J. King Saud Univ. Comput. Inf. Sci. 34(9): 7775-7789 (2022) - [j11]Oguzhan Ahmet Arik:
Additive manufacturing scheduling problem considering assembly operations of parts. Oper. Res. 22(3): 3063-3087 (2022) - [j10]Gülçin Canbulut, Erkan Köse, Oguzhan Ahmet Arik:
Public transportation vehicle selection by the grey relational analysis method. Public Transp. 14(2): 367-384 (2022) - 2021
- [j9]Oguzhan Ahmet Arik:
Single machine earliness/tardiness scheduling problem with grey processing times and the grey common due date. Grey Syst. Theory Appl. 11(1): 95-109 (2021) - [j8]Oguzhan Ahmet Arik, Mehmet Duran Toksari:
A Genetic Algorithm Approach to Parallel Machine Scheduling Problems Under Effects of Position-Dependent Learning and Linear Deterioration: Genetic Algorithm to Parallel Machine Scheduling Problems. Int. J. Appl. Metaheuristic Comput. 12(3): 195-211 (2021) - [j7]Oguzhan Ahmet Arik:
Artificial bee colony algorithm including some components of iterated greedy algorithm for permutation flow shop scheduling problems. Neural Comput. Appl. 33(8): 3469-3486 (2021) - [j6]Oguzhan Ahmet Arik:
Long-term Plantation and Harvesting Planning for Industrial Plantation Forest Areas. Oper. Res. Forum 2(2) (2021) - [j5]Gülçin Canbulut, Erkan Kose, Oguzhan Ahmet Arik:
Handling of revenue sharing contracts within the scope of game theory. Soft Comput. 25(1): 321-329 (2021) - [j4]Oguzhan Ahmet Arik:
Population-based Tabu search with evolutionary strategies for permutation flow shop scheduling problems under effects of position-dependent learning and linear deterioration. Soft Comput. 25(2): 1501-1518 (2021) - 2020
- [j3]Oguzhan Ahmet Arik:
Comparisons of metaheuristic algorithms for unrelated parallel machine weighted earliness/tardiness scheduling problems. Evol. Intell. 13(3): 415-425 (2020) - 2019
- [j2]Oguzhan Ahmet Arik, Erkan Kose, Jeffrey Forrest:
Simple assembly line balancing problem of Type 1 with grey demand and grey task durations. Grey Syst. Theory Appl. 9(4): 401-414 (2019) - 2018
- [j1]Oguzhan Ahmet Arik, Mehmet Duran Toksari:
Multi-objective fuzzy parallel machine scheduling problems under fuzzy job deterioration and learning effects. Int. J. Prod. Res. 56(7): 2488-2505 (2018)
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-06-17 00:14 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:
