default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSelçuk Karabati
Person information
- affiliation: Koç University, Istanbul, Turkey
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j18]Burak Gökgür
, Selçuk Karabati:
Randomized pricing of a storable good in the presence of consumer stockpiling. OR Spectr. 45(4): 1197-1221 (2023)
2010 – 2019
- 2019
- [j17]Burak Gökgür, Selçuk Karabati:
Dynamic and targeted bundle pricing of two independently valued products. Eur. J. Oper. Res. 279(1): 184-198 (2019) - 2018
- [j16]Javad Lessan, Selçuk Karabati:
A preference-based, multi-unit auction for pricing and capacity allocation. Comput. Oper. Res. 91: 237-246 (2018) - 2017
- [j15]O. Cem Ozturk, Selçuk Karabati:
A decision support framework for evaluating revenue performance in sequential purchase contexts. Eur. J. Oper. Res. 263(3): 922-934 (2017)
2000 – 2009
- 2009
- [j14]Can Yildirmaz, Selçuk Karabati, Serpil Sayin:
Pricing and lot-sizing decisions in a two-echelon system with transportation costs. OR Spectr. 31(3): 629 (2009) - 2008
- [j13]Selçuk Karabati, Panos Kouvelis:
Optimal Quantity Discount Design with Limited Information Sharing. Decis. Sci. 39(4): 791-819 (2008) - [j12]Selçuk Karabati, Serpil Sayin:
Single-supplier/multiple-buyer supply chain coordination: Incorporating buyers' expectations under vertical information sharing. Eur. J. Oper. Res. 187(3): 746-764 (2008) - 2007
- [j11]Serpil Sayin, Selçuk Karabati:
Assigning cross-trained workers to departments: A two-stage optimization model to maximize utility and skill improvement. Eur. J. Oper. Res. 176(3): 1643-1658 (2007) - 2006
- [j10]Selçuk Karabati, Can Akkan:
Minimizing sum of completion times on a single machine with sequence-dependent family setup times. J. Oper. Res. Soc. 57(3): 271-280 (2006) - 2004
- [j9]Can Akkan, Selçuk Karabati:
The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm. Eur. J. Oper. Res. 159(2): 420-429 (2004) - 2003
- [j8]Selçuk Karabati, Serpil Sayin:
Assembly line balancing in a mixed-model sequencing environment with synchronous transfers. Eur. J. Oper. Res. 149(2): 417-429 (2003) - 2001
- [j7]Selçuk Karabati, Panagiotis Kouvelis, Gang Yu:
A Min-Max-Sum Resource Allocation Problem and Its Applications. Oper. Res. 49(6): 913-922 (2001) - 2000
- [j6]Gündüz Ulusoy, Selçuk Karabati:
Sixth International Workshop on Project Management and Scheduling. Eur. J. Oper. Res. 127(2): 217-219 (2000) - [j5]Baris Tan, Selçuk Karabati:
Modelling and scheduling of an asynchronous cyclic production line with multiple parts. J. Oper. Res. Soc. 51(11): 1296-1308 (2000) - [j4]Selçuk Karabati:
Part transfer mode selection in a cyclic mixed-model line. IEEE Trans. Robotics Autom. 16(5): 588-592 (2000)
1990 – 1999
- 1999
- [j3]Serpil Sayin, Selçuk Karabati:
A bicriteria approach to the two-machine flow shop scheduling problem. Eur. J. Oper. Res. 113(2): 435-449 (1999) - 1998
- [j2]Selçuk Karabati, Baris Tan:
Stochastic cyclic scheduling problem in synchronous assembly and production lines. J. Oper. Res. Soc. 49(11): 1173-1187 (1998) - 1994
- [j1]Selçuk Karabati, Panagiotis Kouvelis:
The interface of buffer design and cyclic scheduling decisions in deterministic flow lines. Ann. Oper. Res. 50(1): 295-317 (1994)
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-30 21:32 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:
