Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Selçuk Karabati
@article{DBLP:journals/ors/GokgurK23, author = {Burak G{\"{o}}kg{\"{u}}r and Sel{\c{c}}uk Karabati}, title = {Randomized pricing of a storable good in the presence of consumer stockpiling}, journal = {{OR} Spectr.}, volume = {45}, number = {4}, pages = {1197--1221}, year = {2023}, url = {https://doi.org/10.1007/s00291-023-00731-1}, doi = {10.1007/S00291-023-00731-1}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ors/GokgurK23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eor/GokgurK19, author = {Burak G{\"{o}}kg{\"{u}}r and Sel{\c{c}}uk Karabati}, title = {Dynamic and targeted bundle pricing of two independently valued products}, journal = {Eur. J. Oper. Res.}, volume = {279}, number = {1}, pages = {184--198}, year = {2019}, url = {https://doi.org/10.1016/j.ejor.2019.05.022}, doi = {10.1016/J.EJOR.2019.05.022}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eor/GokgurK19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cor/LessanK18, author = {Javad Lessan and Sel{\c{c}}uk Karabati}, title = {A preference-based, multi-unit auction for pricing and capacity allocation}, journal = {Comput. Oper. Res.}, volume = {91}, pages = {237--246}, year = {2018}, url = {https://doi.org/10.1016/j.cor.2017.09.024}, doi = {10.1016/J.COR.2017.09.024}, timestamp = {Tue, 18 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cor/LessanK18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eor/OzturkK17, author = {O. Cem Ozturk and Sel{\c{c}}uk Karabati}, title = {A decision support framework for evaluating revenue performance in sequential purchase contexts}, journal = {Eur. J. Oper. Res.}, volume = {263}, number = {3}, pages = {922--934}, year = {2017}, url = {https://doi.org/10.1016/j.ejor.2017.06.029}, doi = {10.1016/J.EJOR.2017.06.029}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eor/OzturkK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ors/YildirmazKS09, author = {Can Yildirmaz and Sel{\c{c}}uk Karabati and Serpil Sayin}, title = {Pricing and lot-sizing decisions in a two-echelon system with transportation costs}, journal = {{OR} Spectr.}, volume = {31}, number = {3}, pages = {629}, year = {2009}, url = {https://doi.org/10.1007/s00291-008-0156-1}, doi = {10.1007/S00291-008-0156-1}, timestamp = {Fri, 06 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ors/YildirmazKS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dsj/KarabatiK08, author = {Sel{\c{c}}uk Karabati and Panos Kouvelis}, title = {Optimal Quantity Discount Design with Limited Information Sharing}, journal = {Decis. Sci.}, volume = {39}, number = {4}, pages = {791--819}, year = {2008}, url = {https://doi.org/10.1111/j.1540-5915.2008.00212.x}, doi = {10.1111/J.1540-5915.2008.00212.X}, timestamp = {Fri, 13 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dsj/KarabatiK08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eor/KarabatiS08, author = {Sel{\c{c}}uk Karabati and Serpil Sayin}, title = {Single-supplier/multiple-buyer supply chain coordination: Incorporating buyers' expectations under vertical information sharing}, journal = {Eur. J. Oper. Res.}, volume = {187}, number = {3}, pages = {746--764}, year = {2008}, url = {https://doi.org/10.1016/j.ejor.2006.05.046}, doi = {10.1016/J.EJOR.2006.05.046}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eor/KarabatiS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eor/SayinK07, author = {Serpil Sayin and Sel{\c{c}}uk Karabati}, title = {Assigning cross-trained workers to departments: {A} two-stage optimization model to maximize utility and skill improvement}, journal = {Eur. J. Oper. Res.}, volume = {176}, number = {3}, pages = {1643--1658}, year = {2007}, url = {https://doi.org/10.1016/j.ejor.2005.10.045}, doi = {10.1016/J.EJOR.2005.10.045}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eor/SayinK07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jors/KarabatiA06, author = {Sel{\c{c}}uk Karabati and Can Akkan}, title = {Minimizing sum of completion times on a single machine with sequence-dependent family setup times}, journal = {J. Oper. Res. Soc.}, volume = {57}, number = {3}, pages = {271--280}, year = {2006}, url = {https://doi.org/10.1057/palgrave.jors.2601989}, doi = {10.1057/PALGRAVE.JORS.2601989}, timestamp = {Mon, 08 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jors/KarabatiA06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eor/AkkanK04, author = {Can Akkan and Sel{\c{c}}uk Karabati}, title = {The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm}, journal = {Eur. J. Oper. Res.}, volume = {159}, number = {2}, pages = {420--429}, year = {2004}, url = {https://doi.org/10.1016/S0377-2217(03)00415-6}, doi = {10.1016/S0377-2217(03)00415-6}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eor/AkkanK04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eor/KarabatiS03, author = {Sel{\c{c}}uk Karabati and Serpil Sayin}, title = {Assembly line balancing in a mixed-model sequencing environment with synchronous transfers}, journal = {Eur. J. Oper. Res.}, volume = {149}, number = {2}, pages = {417--429}, year = {2003}, url = {https://doi.org/10.1016/S0377-2217(02)00764-6}, doi = {10.1016/S0377-2217(02)00764-6}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eor/KarabatiS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ior/KarabatiKY01, author = {Sel{\c{c}}uk Karabati and Panagiotis Kouvelis and Gang Yu}, title = {A Min-Max-Sum Resource Allocation Problem and Its Applications}, journal = {Oper. Res.}, volume = {49}, number = {6}, pages = {913--922}, year = {2001}, url = {https://doi.org/10.1287/opre.49.6.913.10023}, doi = {10.1287/OPRE.49.6.913.10023}, timestamp = {Tue, 31 Mar 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ior/KarabatiKY01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eor/UlusoyK00, author = {G{\"{u}}nd{\"{u}}z Ulusoy and Sel{\c{c}}uk Karabati}, title = {Sixth International Workshop on Project Management and Scheduling}, journal = {Eur. J. Oper. Res.}, volume = {127}, number = {2}, pages = {217--219}, year = {2000}, url = {https://doi.org/10.1016/S0377-2217(00)00060-6}, doi = {10.1016/S0377-2217(00)00060-6}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eor/UlusoyK00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jors/TanK00, author = {Baris Tan and Sel{\c{c}}uk Karabati}, title = {Modelling and scheduling of an asynchronous cyclic production line with multiple parts}, journal = {J. Oper. Res. Soc.}, volume = {51}, number = {11}, pages = {1296--1308}, year = {2000}, url = {https://doi.org/10.1057/palgrave.jors.2601020}, doi = {10.1057/PALGRAVE.JORS.2601020}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jors/TanK00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/trob/Karabati00, author = {Sel{\c{c}}uk Karabati}, title = {Part transfer mode selection in a cyclic mixed-model line}, journal = {{IEEE} Trans. Robotics Autom.}, volume = {16}, number = {5}, pages = {588--592}, year = {2000}, url = {https://doi.org/10.1109/70.880808}, doi = {10.1109/70.880808}, timestamp = {Tue, 19 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/trob/Karabati00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eor/SayinK99, author = {Serpil Sayin and Sel{\c{c}}uk Karabati}, title = {A bicriteria approach to the two-machine flow shop scheduling problem}, journal = {Eur. J. Oper. Res.}, volume = {113}, number = {2}, pages = {435--449}, year = {1999}, url = {https://doi.org/10.1016/S0377-2217(98)00009-5}, doi = {10.1016/S0377-2217(98)00009-5}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eor/SayinK99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jors/KarabatiT98, author = {Sel{\c{c}}uk Karabati and Baris Tan}, title = {Stochastic cyclic scheduling problem in synchronous assembly and production lines}, journal = {J. Oper. Res. Soc.}, volume = {49}, number = {11}, pages = {1173--1187}, year = {1998}, url = {https://doi.org/10.1057/palgrave.jors.2600625}, doi = {10.1057/PALGRAVE.JORS.2600625}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jors/KarabatiT98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/anor/KarabatiK94, author = {Sel{\c{c}}uk Karabati and Panagiotis Kouvelis}, title = {The interface of buffer design and cyclic scheduling decisions in deterministic flow lines}, journal = {Ann. Oper. Res.}, volume = {50}, number = {1}, pages = {295--317}, year = {1994}, url = {https://doi.org/10.1007/BF02085645}, doi = {10.1007/BF02085645}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/anor/KarabatiK94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.