Ceyda Oǧuz

2.3k total citations
47 papers, 1.7k citations indexed

About

Ceyda Oǧuz is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Molecular Biology. According to data from OpenAlex, Ceyda Oǧuz has authored 47 papers receiving a total of 1.7k indexed citations (citations by other indexed papers that have themselves been cited), including 38 papers in Industrial and Manufacturing Engineering, 12 papers in Computer Networks and Communications and 4 papers in Molecular Biology. Recurrent topics in Ceyda Oǧuz's work include Scheduling and Optimization Algorithms (30 papers), Advanced Manufacturing and Logistics Optimization (18 papers) and Assembly Line Balancing Optimization (15 papers). Ceyda Oǧuz is often cited by papers focused on Scheduling and Optimization Algorithms (30 papers), Advanced Manufacturing and Logistics Optimization (18 papers) and Assembly Line Balancing Optimization (15 papers). Ceyda Oǧuz collaborates with scholars based in Türkiye, Hong Kong and Poland. Ceyda Oǧuz's co-authors include T.C.E. Cheng, M. Fi̇kret Ercan, Pierre Hansen, Emrah B. Edis, Nenad Mladenović, Adam Janiak, İrem Özkarahan, Gökhan Kirlik, F. Sibel Salman and Myrtle P. Bell and has published in prestigious journals such as Bioinformatics, European Journal of Operational Research and Operations Research.

In The Last Decade

Ceyda Oǧuz

47 papers receiving 1.7k citations

Peers

Ceyda Oǧuz

IME

CNC

Kangbok Lee United States

Yasser Dessouky United States

Balbir Barn United Kingdom

Mohamed I. Dessouky United States

Federico Liberatore Spain

Shaul P. Ladany Israel

Markus Leitner Austria

George Vairaktarakis United States

Leonilde Varela Portugal

Kangbok Lee United States

Ceyda Oǧuz

732 ×0.5

IME

436 ×1.3

CNC

17 ×0.1

45 ×0.3

20 ×0.2

Citations per year, relative to Ceyda Oǧuz Ceyda Oǧuz (= 1×) peers Kangbok Lee

Countries citing papers authored by Ceyda Oǧuz

Since Specialization

Citations

This map shows the geographic impact of Ceyda Oǧuz's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Ceyda Oǧuz with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ceyda Oǧuz more than expected).

Fields of papers citing papers by Ceyda Oǧuz

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Ceyda Oǧuz. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Ceyda Oǧuz. The network helps show where Ceyda Oǧuz may publish in the future.

Co-authorship network of co-authors of Ceyda Oǧuz

This figure shows the co-authorship network connecting the top 25 collaborators of Ceyda Oǧuz. A scholar is included among the top collaborators of Ceyda Oǧuz based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Ceyda Oǧuz. Ceyda Oǧuz is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Üster, Halit, et al.. (2024). Incorporating patients’ appointment date preferences into decision-making: A simulation and optimization study. Computers & Industrial Engineering. 196. 110521–110521. 1 indexed citations

Oǧuz, Ceyda, et al.. (2021). Generalized order acceptance and scheduling problem with batch delivery: Models and metaheuristics. Computers & Operations Research. 134. 105414–105414. 17 indexed citations

Oǧuz, Ceyda, et al.. (2021). A matheuristic for the generalized order acceptance and scheduling problem. European Journal of Operational Research. 299(1). 87–103. 18 indexed citations

Oǧuz, Ceyda, et al.. (2019). A Multitask Multiple Kernel Learning Algorithm for Survival Analysis with Application to Cancer Biology. International Conference on Machine Learning. 1576–1585. 7 indexed citations

Edis, Emrah B., Ceyda Oǧuz, & İrem Özkarahan. (2013). Parallel machine scheduling with additional resources: Notation, classification, models and solution methods. European Journal of Operational Research. 230(3). 449–463. 115 indexed citations

Edis, Emrah B. & Ceyda Oǧuz. (2012). Parallel machine scheduling with flexible resources. Computers & Industrial Engineering. 63(2). 433–447. 43 indexed citations

Błażewicz, Jacek, et al.. (2011). A hyper-heuristic approach to sequencing by hybridization of DNA sequences. Annals of Operations Research. 207(1). 27–41. 12 indexed citations

Oǧuz, Ceyda, et al.. (2010). A tabu search algorithm for order acceptance and scheduling. Computers & Operations Research. 39(6). 1197–1205. 101 indexed citations

Błażewicz, Jacek, Fred Glover, Marta Kasprzak, et al.. (2006). Dealing with repetitions in sequencing by hybridization. Computational Biology and Chemistry. 30(5). 313–320. 9 indexed citations

10.

Oǧuz, Ceyda, et al.. (2005). Computational complexity of some scheduling problems with multiprocessor tasks. Discrete Optimization. 2(4). 391–408. 7 indexed citations

11.

Ercan, M. Fi̇kret & Ceyda Oǧuz. (2005). Performance of local search heuristics on scheduling a class of pipelined multiprocessor tasks. Computers & Electrical Engineering. 31(8). 537–555. 9 indexed citations

12.

Oǧuz, Ceyda, et al.. (2004). Berth allocation as a moldable task scheduling problem. PolyU Institutional Research Archive (Hong Kong Polytechnic University). 8 indexed citations

13.

Oǧuz, Ceyda & M. Fi̇kret Ercan. (2004). A genetic algorithm for multilayer multiprocessor task scheduling. 149. 168–170 Vol. 2. 5 indexed citations

14.

Hansen, Pierre, Ceyda Oǧuz, & Nenad Mladenović. (2003). Variable Neighborhood Search for Minimum Cost Berth Allocation. RePEc: Research Papers in Economics. 1–24. 2 indexed citations

15.

Hansen, Pierre & Ceyda Oǧuz. (2003). A Note on Formulations of Static and Dynamic Berth Allocation Problems. Les Cahiers du GERAD. 1–20. 32 indexed citations

16.

Ercan, M. Fi̇kret, et al.. (2001). Scheduling image processing tasks in a multilayer system. Computers & Electrical Engineering. 27(6). 429–443. 3 indexed citations

17.

Oǧuz, Ceyda, et al.. (2001). Single-machine scheduling with a common due window. Computers & Operations Research. 28(2). 157–175. 41 indexed citations

18.

Oǧuz, Ceyda, Bertrand M.T. Lin, & T.C.E. Cheng. (1997). Two-stage flowshop scheduling with a common second-stage machine. Computers & Operations Research. 24(12). 1169–1174. 31 indexed citations

19.

Cheng, T.C.E., Ceyda Oǧuz, & Xiangtong Qi. (1996). Due-date assignment and single machine scheduling with compressible processing times. International Journal of Production Economics. 43(1). 29–35. 60 indexed citations

20.

Oǧuz, Ceyda, et al.. (1991). Incorporating just-in-time into a decision support system environment. European Journal of Operational Research. 55(3). 344–356. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact