default search action
Alper Hamzadayi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j15]Çagri Sel, M. Edib Gurkan
, Alper Hamzadayi
Energy-aware production lot-sizing and parallel machine scheduling with the product-specific machining tools and power requirements. Comput. Ind. Eng. 196: 110503 (2024) - 2022
- [j14]Gizem Çakir, Kemal Subulan, Seyda Topaloglu Yildiz
A comparative study of modeling and solution approaches for the multi-mode resource-constrained discrete time-cost trade-off problem: Case study of an ERP implementation project. Comput. Ind. Eng. 169: 108201 (2022) - [j13]Mustafa Avci
A branch-and-cut approach for the distributed no-wait flowshop scheduling problem. Comput. Oper. Res. 148: 106009 (2022) - [j12]Adil Baykasoglu, Kemal Subulan, Alper Hamzadayi:
Capability-based machine layout with a matheuristic-based approach. Expert Syst. Appl. 198: 116900 (2022) - 2020
- [j11]Alper Hamzadayi:
An effective benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem. Comput. Oper. Res. 123: 105006 (2020) - [j10]Alper Hamzadayi, Adil Baykasoglu
Solving combinatorial optimization problems with single seekers society algorithm. Knowl. Based Syst. 201-202: 106036 (2020) - [j9]Tolga Bektas
Benders decomposition for the mixed no-idle permutation flowshop scheduling problem. J. Sched. 23(4): 513-523 (2020)
2010 – 2019
- 2019
- [j8]Adil Baykasoglu
Single Seekers Society (SSS): Bringing together heuristic optimization algorithms for solving complex problems. Knowl. Based Syst. 165: 53-76 (2019) - 2017
- [j7]Alper Hamzadayi, Gokalp Yildiz:
Modeling and solving static m identical parallel machines scheduling problem with a common server and sequence dependent setup times. Comput. Ind. Eng. 106: 287-298 (2017) - 2016
- [j6]Alper Hamzadayi, Gokalp Yildiz:
Event driven strategy based complete rescheduling approaches for dynamic m identical parallel machines scheduling problem with a common server. Comput. Ind. Eng. 91: 66-84 (2016) - [j5]Alper Hamzadayi, Gokalp Yildiz:
Hybrid strategy based complete rescheduling approaches for dynamic m identical parallel machines scheduling problem with a common server. Simul. Model. Pract. Theory 63: 104-132 (2016) - 2014
- [j4]Adil Baykasoglu
Testing the performance of teaching-learning based optimization (TLBO) algorithm on combinatorial problems: Flow shop and job shop scheduling cases. Inf. Sci. 276: 204-218 (2014) - 2013
- [j3]Alper Hamzadayi, Gokalp Yildiz:
A simulated annealing algorithm based approach for balancing and sequencing of mixed-model U-lines. Comput. Ind. Eng. 66(4): 1070-1084 (2013) - [j2]Alper Hamzadayi, Seyda Topaloglu
Nested simulated annealing approach to periodic routing problem of a retail distribution system. Comput. Oper. Res. 40(12): 2893-2905 (2013) - 2012
- [j1]Alper Hamzadayi, Gokalp Yildiz:
A genetic algorithm based approach for simultaneously balancing and sequencing of mixed-model U-lines with parallel workstations and zoning constraints. Comput. Ind. Eng. 62(1): 206-215 (2012)
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-10-04 19:55 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: