Bilgilendirme: Kurulum ve veri kapsamındaki çalışmalar devam etmektedir. Göstereceğiniz anlayış için teşekkür ederiz.
 

Kandiller, Levent

Profile Picture
Profile URL
https://hdl.handle.net/20.500.12416/9256
Name Variants
Job Title
Prof. Dr.
Email Address
kandiller@cankaya.edu.tr
Main Affiliation
Endüstri Mühendisliği
Status
Former Staff
Website
ORCID ID
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID

Sustainable Development Goals

SDG data is not available
This researcher does not have a Scopus ID.
This researcher does not have a WoS ID.
Scholarly Output

6

Articles

4

Views / Downloads

393/21

Supervised MSc Theses

0

Supervised PhD Theses

0

WoS Citation Count

47

Scopus Citation Count

67

WoS h-index

3

Scopus h-index

3

Patents

0

Projects

0

WoS Citations per Publication

7.83

Scopus Citations per Publication

11.17

Open Access Source

1

Supervised Theses

0

Google Analytics Visitor Traffic

JournalCount
Naval Research Logistics (NRL)2
International Journal of Production Research1
Path to Innovation: Clusters1
Proceedings of the 41st International Conference on Computers & Industrial Engineering1
Savunma Bilimleri Dergisi1
Current Page: 1 / 1

Scopus Quartile Distribution

Competency Cloud

GCRIS Competency Cloud

Filters

Reset filters

Settings

Scholarly Output Search Results

Now showing 1 - 6 of 6
  • Thumbnail Image
    Article
    Ağların Hareketli Yol-Kesici Tarafından En Kısa Güzergâh Kullanılarak Kesilmesi
    (2012) Kabarcık, Ahmet; Kandiller, Levent; Aygüneş, Haluk
    Bu makalede yolların hareketli yol-kesici tarafından devre dışı bırakıldığı bir ağ kesme problemi ele alınmıştır. İçiçe geçmiş iki ağdan biri ağ-kullanıcı tarafından, diğeri ise yol-kesici tarafından kullanılmaktadır. Yol-kesici ağı üzerindeki düğümler ağ-kullanıcı ağındaki yolların ya da düğümlerin üzerinde konuşlanmıştır. Yol-kesici ağı üzerindeki düğümler imha edilmeye aday noktalardır. Bu çalışmada ağ-kullanıcının başlangıç ve hedef düğümleri arasındaki tüm güzergâhlarını imha etmek için yol-kesicinin kullanacağı en kısa güzergâh bulunmaya çalışılmaktadır. Problemin çözümü için dal-sınır yöntemi kullanılarak bir algoritma geliştirilmiştir.
  • Thumbnail Image
    Article
    Citation - WoS: 26
    Citation - Scopus: 37
    Anti-Ship Missile Defense for a Naval Task Group
    (Wiley-blackwell, 2011) Kandiller, Levent; Karasakal, Orhan; Ozdemirel, Nur Evin
    In this study, we present a new formulation for the air defense problem of warships in a naval task group and propose a solution method. We define the missile allocation problem (MAP) as the optimal allocation of a set of surface-to-air missiles (SAMs) of a naval task group to a set of attacking air targets. MAP is a new treatment of an emerging problem fostered by the rapid increase in the capabilities of anti-ship missiles (ASMs), the different levels of air defense capabilities of the warships against the ASM threat, and new technology that enables a fully coordinated and collective defense. In addition to allocating SAMs to ASMs, MAP also schedules launching of SAM rounds according to shoot-look-shoot engagement policy or its variations, considering multiple SAM systems and ASM types. MAP can be used for air defense planning under a given scenario. As thorough scenario analysis would require repetitive use of MAP, we propose efficient heuristic procedures for solving the problem. (C) 2011 Wiley Periodicals, Inc. Naval Research Logistics 58: 305-322, 2011
  • Thumbnail Image
    Article
    Citation - WoS: 6
    Citation - Scopus: 15
    A Branch and Bound Algorithm for Sector Allocation of a Naval Task Group
    (Wiley-blackwell, 2011) Ozdemirel, Nur Evin; Karasakal, Orhan; Kandiller, Levent
    A naval task group (TG) is a collection of naval combatants and auxiliaries that are grouped together for the accomplishment of one or more missions. Ships forming a TG are located in predefined sectors. We define determination of ship sector locations to provide a robust air defense formation as the sector allocation problem (SAP). A robust formation is one that is very effective against a variety of attack scenarios but not necessarily the most effective against any scenario. We propose a 0-1 integer linear programming formulation for SAP. The model takes the size and the direction of threat into account as well as the defensive weapons of the naval TG. We develop tight lower and upper bounds by incorporating some valid inequalities and use a branch and bound algorithm to exactly solve SAP. We report computational results that demonstrate the effectiveness of the proposed solution approach. (C) 2011 Wiley Periodicals, Inc. Naval Research Logistics 58: 655-669, 2011
  • Thumbnail Image
    Conference Object
    Sector Selection for Cluster Formation at OSTİM Industrial Zone: An AHP Application
    (2009) Çetinkaya, Ferda Can; Kandiller, Levent; Satır, Benhür; Umutlu, Mehmet
  • Thumbnail Image
    Article
    Citation - WoS: 15
    Citation - Scopus: 15
    A Constraint Programming Approach To a Real-World Workforce Scheduling Problem for Multi-Manned Assembly Lines With Sequence-Dependent Setup Times
    (Taylor & Francis Ltd, 2024) Kandiller, Levent; Drake, John H.; Guner, Funda; Gorur, Abdul K.; Satir, Benhur
    For over five decades, researchers have presented various assembly line problems. Recently, assembly lines with multiple workers at each workstation have become very common in the literature. These lines are often found in the manufacturing of large vehicles, where workers at a workstation may perform their assigned tasks at the same time. Most research on multi-manned assembly lines focuses on balancing tasks and workers among workstations and scheduling tasks for workers. This study, however, concentrates on assigning tasks to workers already assigned to a specific workstation, rather than balancing the entire line. The problem was identified through an industrial case study at a large vehicle manufacturing company. The study presents two methods, one using mixed integer linear programming and the other using constraint programming, to minimise the number of workers required on a multi-manned assembly line with sequence-dependent setup times. The results of the computational experiments indicate that the constraint programming method performs better than the mixed integer linear programming method on several modified benchmark instances from the literature. The constraint programming model is also tested on the real-world scenario of our industrial case study and leads to significant improvements in the productivity of the workstations.
  • Thumbnail Image
    Conference Object
    An optimization model for worker assignment of a mixed model vehicle production assembly line under worker mobility
    (2011) Karabak, Funda; Güner, Nizamettin Doğan; Satır, Benhür; Kandiller, Levent; Gürsoy, I.
    In this study, we consider the problem of worker assignment in a mixed model vehicle production assembly line. In particular, we focus on large size vehicles like busses and trucks that have multi zones in which workers can perform their assigned tasks simultaneously. This situation requires balancing the workloads of workers assigned in a certain set of workstations. Over the assembly line, it is allowed that workers may change their workstations during the same cycle. Moreover, each worker has a certain skill level which configures the possible set of tasks to be undertaken. Scale of the product, worker mobility and skill differences make the studied problem complicated. We propose a worker assignment model and develop a heuristic algorithm whose performance is to be evaluated against the optimal seeking methods in terms of small sized problems. We report on the validation of our heuristic algorithm in real …