default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCeyda Oguz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j30]Özgür Ünsal
, Halit Üster, Ceyda Oguz:
Incorporating patients' appointment date preferences into decision-making: A simulation and optimization study. Comput. Ind. Eng. 196: 110521 (2024)- [j29]Fotios Petropoulos, Gilbert Laporte, Emel Aktas, Sibel A. Alumur, Claudia Archetti, Hayriye Ayhan, Maria Battarra, Julia A. Bennell, Jean-Marie Bourjolly, John E. Boylan, Michèle Breton, David Canca, Laurent Charlin, Bo Chen, Cihan Tugrul Cicek, Louis Anthony Cox, Christine S. M. Currie, Erik Demeulemeester, Li Ding, Stephen M. Disney, Matthias Ehrgott, Martin J. Eppler, Günes Erdogan, Bernard Fortz, L. Alberto Franco, Jens Frische, Salvatore Greco, Amanda J. Gregory, Raimo P. Hämäläinen, Willy Herroelen, Mike Hewitt, Jan Holmström, John N. Hooker, Tugçe Isik, Jill Johnes, Bahar Yetis Kara, Özlem Karsu, Katherine Kent, Charlotte Köhler, Martin H. Kunc, Yong-Hong Kuo, Adam N. Letchford, Janny Leung, Dong Li, Haitao Li, Judit Lienert, Ivana Ljubic, Andrea Lodi, Sebastián Lozano, Virginie Lurkin, Silvano Martello, Ian G. McHale, Gerald Midgley, John D. W. Morecroft, Akshay Mutha, Ceyda Oguz, Sanja Petrovic, Ulrich Pferschy, Harilaos N. Psaraftis, Sam Rose, Lauri Saarinen, Saïd Salhi, Jing-Sheng Song, Dimitrios Sotiros, Kathryn E. Stecke, Arne K. Strauss, Istenç Tarhan, Clemens Thielen, Paolo Toth, Tom Van Woensel, Greet Vanden Berghe, Christos Vasilakis, Vikrant Vaze, Daniele Vigo, Kai Virtanen, Xun Wang, Rafal Weron, Leroy White, Mike Yearworth, E. Alper Yildirim, Georges Zaccour, Xuying Zhao:
Operational Research: methods and applications. J. Oper. Res. Soc. 75(3): 423-617 (2024) - 2022
- [j28]Istenç Tarhan, Ceyda Oguz:
A matheuristic for the generalized order acceptance and scheduling problem. Eur. J. Oper. Res. 299(1): 87-103 (2022) - 2021
- [j27]Istenç Tarhan, Ceyda Oguz:
Generalized order acceptance and scheduling problem with batch delivery: Models and metaheuristics. Comput. Oper. Res. 134: 105414 (2021)
2010 – 2019
- 2019
- [j26]Onur Dereli, Ceyda Oguz, Mehmet Gönen:
Path2Surv: Pathway/gene set-based survival analysis using multiple kernel learning. Bioinform. 35(24): 5137-5145 (2019) - [c7]Onur Dereli, Ceyda Oguz, Mehmet Gönen:
A Multitask Multiple Kernel Learning Algorithm for Survival Analysis with Application to Cancer Biology. ICML 2019: 1576-1585 - 2017
- [j25]Andreas T. Ernst, Ceyda Oguz, Gaurav Singh, Gita Taherkhani:
Mathematical models for the berth allocation problem in dry bulk terminals. J. Sched. 20(5): 459-473 (2017) - 2013
- [j24]Jacek Blazewicz, Edmund K. Burke, Graham Kendall, Wojciech Mruczkiewicz, Ceyda Oguz, Aleksandra Swiercz:
A hyper-heuristic approach to sequencing by hybridization of DNA sequences. Ann. Oper. Res. 207(1): 27-41 (2013) - [j23]Emrah B. Edis, Ceyda Oguz, Irem Ozkarahan:
Parallel machine scheduling with additional resources: Notation, classification, models and solution methods. Eur. J. Oper. Res. 230(3): 449-463 (2013) - 2012
- [j22]Emrah B. Edis, Ceyda Oguz:
Parallel machine scheduling with flexible resources. Comput. Ind. Eng. 63(2): 433-447 (2012) - [j21]Bahriye Cesaret, Ceyda Oguz, F. Sibel Salman:
A tabu search algorithm for order acceptance and scheduling. Comput. Oper. Res. 39(6): 1197-1205 (2012) - [j20]Gokhan Kirlik, Ceyda Oguz:
A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine. Comput. Oper. Res. 39(7): 1506-1520 (2012) - [j19]Klemens Katterbauer, Ceyda Oguz, F. Sibel Salman:
Hybrid Adaptive Large Neighborhood Search for the Optimal Statistic Median Problem. Comput. Oper. Res. 39(11): 2679-2687 (2012) - 2011
- [j18]Jacek Blazewicz, T. C. Edwin Cheng, Maciej Machowiak, Ceyda Oguz:
Berth and quay crane allocation: a moldable task scheduling model. J. Oper. Res. Soc. 62(7): 1189-1197 (2011) - [c6]Emrah B. Edis, Ceyda Oguz:
Parallel Machine Scheduling with Additional Resources: A Lagrangian-Based Constraint Programming Approach. CPAIOR 2011: 92-98 - 2010
- [j17]Sule Atalay, Metin Çanci, Güven Kaya, Ceyda Oguz, Metin Türkay:
Intermodal transportation in Istanbul via Marmaray. IBM J. Res. Dev. 54(6): 9 (2010)
2000 – 2009
- 2009
- [j16]Antoine Jouglet, Ceyda Oguz, Marc Sevaux:
Hybrid Flow-Shop: a Memetic Algorithm Using Constraint-Based Scheduling for Efficient Search. J. Math. Model. Algorithms 8(3): 271-292 (2009) - [j15]Ceyda Oguz, Kirk Pruhs:
Editorial. J. Sched. 12(5): 435-436 (2009) - 2008
- [j14]Pierre Hansen, Ceyda Oguz, Nenad Mladenovic:
Variable neighborhood search for minimum cost berth allocation. Eur. J. Oper. Res. 191(3): 636-649 (2008) - 2006
- [j13]Jacek Blazewicz, Fred W. Glover, Marta Kasprzak, Wojciech T. Markiewicz, Ceyda Oguz, Dietrich Rebholz-Schuhmann, Aleksandra Swiercz:
Dealing with repetitions in sequencing by hybridization. Comput. Biol. Chem. 30(5): 313-320 (2006) - [j12]Jacek Blazewicz, Ceyda Oguz, Aleksandra Swiercz, Jan Weglarz:
DNA Sequencing by Hybridization via Genetic Search. Oper. Res. 54(6): 1185-1192 (2006) - [j11]Peter Brucker, Sigrid Knust, Ceyda Oguz:
Scheduling chains with identical jobs and constant delays on a single machine. Math. Methods Oper. Res. 63(1): 63-75 (2006) - 2005
- [j10]Muhammet Fikret Ercan, Ceyda Oguz:
Performance of local search heuristics on scheduling a class of pipelined multiprocessor tasks. Comput. Electr. Eng. 31(8): 537-555 (2005) - [j9]Yakov Zinder, Van Ha Do, Ceyda Oguz:
Computational complexity of some scheduling problems with multiprocessor tasks. Discret. Optim. 2(4): 391-408 (2005) - [j8]Ceyda Oguz, Muhammet Fikret Ercan:
A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks. J. Sched. 8(4): 323-351 (2005) - [c5]Jacek Blazewicz, Beniamin Dziurdza, Wojciech T. Markiewicz, Ceyda Oguz:
The Parallel Genetic Algorithm for Designing DNA Randomizations in a Combinatorial Protein Experiment. PPAM 2005: 1097-1105 - 2004
- [j7]Ceyda Oguz, Yakov Zinder, Van Ha Do, Adam Janiak, Maciej Lichtenstein:
Hybrid flow-shop scheduling problems with multiprocessor task systems. Eur. J. Oper. Res. 152(1): 115-131 (2004) - 2003
- [j6]Ceyda Oguz, Muhammet Fikret Ercan, T. C. Edwin Cheng, Yu-Fai Fung:
Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop. Eur. J. Oper. Res. 149(2): 390-403 (2003) - [c4]Ceyda Oguz, Yu-Fai Fung, Muhammet Fikret Ercan, X. T. Qi:
Parallel Genetic Algorithm for a Flow-Shop Problem with Multiprocessor Tasks. International Conference on Computational Science 2003: 548-559 - [c3]Ceyda Oguz, Yu-Fai Fung, Muhammet Fikret Ercan, X. T. Qi:
Parallel Genetic Algorithm for a Flow-Shop Problem with Multiprocessor Tasks. ICCSA (1) 2003: 987-997 - 2001
- [j5]Wing-Kwan Yeung, Ceyda Oguz, T. C. Edwin Cheng:
Minimizing Weighted Number of Early and Tardy Jobs with a Common Due Window Involving Location Penalty. Ann. Oper. Res. 108(1-4): 33-54 (2001) - [j4]Muhammet Fikret Ercan, Yu-Fai Fung, Ceyda Oguz:
Scheduling image processing tasks in a multilayer system. Comput. Electr. Eng. 27(6): 429-443 (2001) - [j3]Wing-Kwan Yeung, Ceyda Oguz, T. C. Edwin Cheng:
Single-machine scheduling with a common due window. Comput. Oper. Res. 28(2): 157-175 (2001) - [c2]Muhammet Fikret Ercan, Ceyda Oguz, Yu-Fai Fung:
Performance Evaluation of Heuristics for Scheduling Pipelined Multiprocessor Tasks. International Conference on Computational Science (1) 2001: 61-70
1990 – 1999
- 1999
- [c1]Muhammet Fikret Ercan, Ceyda Oguz, Yu-Fai Fung:
Job Scheduling in a Multi-layer Vision System. Euro-Par 1999: 317-321 - 1997
- [j2]Ceyda Oguz, Bertrand M. T. Lin, T. C. Edwin Cheng:
Two-stage flowshop scheduling with a common second-stage machine. Comput. Oper. Res. 24(12): 1169-1174 (1997) - 1994
- [j1]T. C. Edwin Cheng, Zhi-Long Chen, Ceyda Oguz:
One-machine batching and sequencing of multiple-type items. Comput. Oper. Res. 21(7): 717-721 (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-07 22:05 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:
