default search action
Önder Bulut
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
- [j6]Oktay Karabag, Önder Bulut, Ayhan Özgür Toy, Mehmet Murat Fadiloglu:
An efficient procedure for optimal maintenance intervention in partially observable multi-component systems. Reliab. Eng. Syst. Saf. 244: 109914 (2024) - 2022
- [j5]Nazli Karatas Aygün, Önder Bulut, Emrah Biyik:
A Framework for Capacity Expansion Planning in Failure-Prone Flow-Networks via Systemic Risk Analysis. IEEE Syst. J. 16(1): 820-831 (2022) - 2021
- [j4]Özgün Yücel, Önder Bulut:
Exact analysis of production lines with Coxian-2-distributed processing times and parallel machines. Comput. Ind. Eng. 159: 107471 (2021) - 2019
- [j3]Mehmet Murat Fadiloglu, Önder Bulut:
An embedded Markov chain approach to stock rationing under batch orders. Oper. Res. Lett. 47(2): 92-98 (2019) - 2010
- [j2]Mehmet Murat Fadiloglu, Önder Bulut:
A dynamic rationing policy for continuous-review inventory systems. Eur. J. Oper. Res. 202(3): 675-685 (2010) - [j1]Mehmet Murat Fadiloglu, Önder Bulut:
An embedded Markov chain approach to stock rationing. Oper. Res. Lett. 38(6): 510-515 (2010)
Conference and Workshop Papers
- 2014
- [c8]Önder Bulut, Mehmet Fatih Tasgetiren:
A discrete artificial bee colony algorithm for the Economic Lot Scheduling problem with returns. IEEE Congress on Evolutionary Computation 2014: 551-557 - [c7]Damla Kizilay, Mehmet Fatih Tasgetiren, Önder Bulut, Bilgehan Bostan:
A discrete artificial bee colony algorithm for the assignment and parallel machine scheduling problem in DYO paint company. IEEE Congress on Evolutionary Computation 2014: 653-660 - 2012
- [c6]Mehmet Fatih Tasgetiren, Önder Bulut, Mehmet Murat Fadiloglu:
A discrete harmony search algorithm for the economic lot scheduling problem with power of two policy. IEEE Congress on Evolutionary Computation 2012: 1-8 - 2011
- [c5]Mehmet Fatih Tasgetiren, Önder Bulut, Mehmet Murat Fadiloglu:
A discrete artificial bee colony algorithm for the economic lot scheduling problem. IEEE Congress on Evolutionary Computation 2011: 347-353 - [c4]Önder Bulut, Mehmet Fatih Tasgetiren, Mehmet Murat Fadiloglu:
A Genetic Algorithm for the Economic Lot Scheduling Problem under Extended Basic Period Approach and Power-of-Two Policy. ICIC (2) 2011: 57-65 - [c3]Evrim Ursavas Guldogan, Önder Bulut, Mehmet Fatih Tasgetiren:
A Dynamic Berth Allocation Problem with Priority Considerations under Stochastic Nature. ICIC (2) 2011: 74-82 - [c2]Mehmet Fatih Tasgetiren, Önder Bulut, Quan-Ke Pan, Ponnuthurai Nagaratnam Suganthan:
A differential evolution algorithm for the median cycle problem. SDE 2011: 157-163 - [c1]Mehmet Fatih Tasgetiren, Önder Bulut, Mehmet Murat Fadiloglu:
A Differential Evolution algorithm for the economic lot scheduling problem. SDE 2011: 164-169
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-06-19 21:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint