Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Kagan Gokbayrak"'
Autor:
Kagan Gokbayrak
Publikováno v:
Computers & Operations Research. 144:105853
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0f5b275e9b9fe2177f8969c65c07cedc
https://doi.org/10.1016/j.cor.2022.105853
https://doi.org/10.1016/j.cor.2022.105853
Autor:
Kagan Gokbayrak
Publikováno v:
Computers and Operations Research
Wireless mesh networks (WMNs) are communication networks that provide wireless Internet access over areas with limited infrastructure. Each node in a WMN serves several clients in its coverage area and transfers their traffic over wireless media to a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4ebc02452a0c63438812653e48b8ce21
https://aperta.ulakbim.gov.tr/record/34019
https://aperta.ulakbim.gov.tr/record/34019
Autor:
Ayse Selin Kocaman, Kagan Gokbayrak
Publikováno v:
Computers and Operations Research
We introduce a new continuous location-allocation problem where the facilities have both a fixed opening cost and a coverage distance limitation. The problem has wide applications especially in the spatial planning of water and/or energy access netwo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6fdf5a6b69f4be3cc5aaff893dd25f8a
https://hdl.handle.net/11693/37407
https://hdl.handle.net/11693/37407
Autor:
Kagan Gokbayrak, E. Alper Yıldırım
Publikováno v:
Computers and Operations Research
Wireless mesh networks (WMNs) provide cost-effective alternatives for extending wireless communication over larger geographical areas. In this paper, given a WMN with its nodes and possible wireless links, we consider the problem of gateway node sele
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::92a17e6e59039f604c838f2f1bcfa0e6
https://hdl.handle.net/11693/37412
https://hdl.handle.net/11693/37412
Autor:
Kagan Gokbayrak
Publikováno v:
Discrete Event Dynamic Systems
Cataloged from PDF version of article. We consider reliable mixed line flow shop systems that are composed of controllable and uncontrollable machines. These systems are assumed to receive arrivals at random instants and process jobs deterministicall
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a22033288bfbcaf007a4e25c2a79d0b4
https://doi.org/10.1007/s10626-010-0095-2
https://doi.org/10.1007/s10626-010-0095-2
Autor:
O. Selvi, Kagan Gokbayrak
Publikováno v:
Discrete Event Dynamic Systems
We consider an optimization problem for deterministic flow shop systems processing identical jobs. The service times are initially controllable; they can only be set before processing the first job, and cannot be altered between processes. We derive
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9a51e5f086db886fb23c35003fca9ad5
https://doi.org/10.1007/s10626-009-0061-z
https://doi.org/10.1007/s10626-009-0061-z
Autor:
O. Selvi, Kagan Gokbayrak
Publikováno v:
IEEE Transactions on Automatic Control
Cataloged from PDF version of article. We consider an optimal control problem for the hybrid model of a deterministic flow shop system, in which the jobs are processed in the order they arrive at the system. The problem is decomposed into a higher-le
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::27a53fd805687fd08284ce3d3b121e64
https://doi.org/10.1109/tac.2007.910668
https://doi.org/10.1109/tac.2007.910668
Publikováno v:
Journal of Optimization Theory and Applications. 114:97-132
We consider stochastic discrete optimization problems where the decision variables are nonnegative integers and propose a generalized surrogate problem methodology that modifies and extends previous work in Ref. 1. Our approach is based on an online
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bebd7755f22217c8fe58032d3069b330
https://doi.org/10.1023/a:1015464105071
https://doi.org/10.1023/a:1015464105071
Publikováno v:
IEEE Transactions on Automatic Control. 47:1004-1015
We consider threshold-based admission control policies for traffic in fixed-route circuit-switched networks, and develop a scheme for adjusting the threshold parameters online so that, as operating conditions in the network change, the thresholds "ad
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::639c5aaeb305953f79e8a0737bd00f8c
https://doi.org/10.1109/tac.2002.1008364
https://doi.org/10.1109/tac.2002.1008364