Endüstri Mühendisliği Bölümü Yayın Koleksiyonu
Permanent URI for this collectionhttps://hdl.handle.net/20.500.12416/279
Browse
4 results
Search Results
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, MehmetConference 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 …Article Citation - WoS: 7Citation - Scopus: 16A Branch and Bound Algorithm for Sector Allocation of a Naval Task Group(Wiley-blackwell, 2011) Ozdemirel, Nur Evin; Karasakal, Orhan; Kandiller, LeventA 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, 2011Article Citation - WoS: 27Citation - Scopus: 37Anti-Ship Missile Defense for a Naval Task Group(Wiley-blackwell, 2011) Kandiller, Levent; Karasakal, Orhan; Ozdemirel, Nur EvinIn 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