Browsing Dept. of Industrial Engineering - Master's degree by Title
Now showing items 1-20 of 355
-
Adopting the parallel strategy in a R&D project task
(Bilkent University, 1997)Funding more than one research team in a R&D project task can increase the chance that at least one of them will achieve a timely breakthrough. However resource limitations imply that the budget allocated to each ... -
Air traffic flow management problem with stochastic capacities
(Bilkent University, 2021-09)Air traffic systems have substantial effects on transportation, logistics, and economics in a global scope. Due to both practical significance and intellectual challenges, air traffic flow management problems have been extensively ... -
Airline rescheduling with aircraft unavailability period
(Bilkent University, 2019-06)Airlines design their initial schedules under the assumption that all resources will be available on time and ights will operate as planned. However, some disruptions occur due to mechanical failures and unexpected ... -
Airline scheduling to minimize operational costs and variability
(Bilkent University, 2021-08)Airlines tend to design their flights schedules with the primary concern of the minimization of operational costs. However, the recently emerging idea of resilient scheduling defined as staying operational in case of unexpected ... -
Algorithms for 2 edge connectivity with fixed costs in telecommunications networks
(Bilkent University, 2011)In this thesis, several algorithms are developed in order to provide costeffective and survivable communication in telecommunications networks. In its broadest sense, a survivable network is one which can maintain ... -
Algorithms for on-line vertex enumeration problem
(Bilkent University, 2017-09)Vertex enumeration problem is to enumerate all vertices of a polyhedron P which is given by intersection of finitely many halfspaces. It is a basis for many algorithms designed to solve problems from various application ... -
Algorithms for some discrete location problems
(Bilkent University, 2003-09) -
Algorithms for the integer multicommodity network design problem
(Bilkent University, 2004)In this thesis, we study the problem of logical network design in telecommunication networks. Given a set of nodes and a set of commodities, we aim to locate lightpaths(links) between nodes and route the commodities over ... -
Algorithms for the survivable telecommunications network design problem under dedicated protection
(Bilkent University, 2010)This thesis presents algorithms to solve a survivable network design problem arising in telecommunications networks. As a design problem, we seek to find 2-edge disjoint paths between every potential origin destination ... -
Analyses of serial production lines and assembly systems for throughput and inyerdeparture time variability
(Bilkent University, 1998)In this thesis, we study three different but closely related production system design problems. First, we investigate the effects of various design factors such as number of stations, buffer capacity, allocation of bulfers ... -
Analysis of a hospital call center
(Bilkent University, 2012)In this thesis, we study the call center operations of a particular hospital located in Ankara, namely Güven Hospital. The hospital call center takes role as a medical consulting and appointment center and also domestic ... -
Analysis of consignment contracts for spare parts inventory systems
(Bilkent University, 2006)We study a Vendor Managed Inventory (VMI) partnership between a manufacturer and a retailer. More specifically, we consider a consignment contract, under which the manufacturer assumes the ownership of the inventory in ... -
Analysis of Erlang transfer lines
(Bilkent University, 1997)Transfer lines are widely used in the modeling and analysis of complex production systems. The literature is mostly devoted to the analysis of transfer lines with exponential processing times. However, most of the time ... -
An analysis of FMS scheduling problem: a beam search based algorithm and comparison of scheduling schemes
(Bilkent University, 1994)FMS scheduling procedures in the literature can be classified into on-line and off-line schemes according to the number of scheduling decisions made at a point in time. Online scheduling attempts to schedule operations ... -
Analysis of locations of existing fire stations in Ankara in comparison to optimized locations
(Bilkent University, 2012)This thesis aims to evaluate the locations of the existing fire stations in the city of Ankara. Vertex restricted p-center problem is solved via set covering problem and optimal locations of fire stations are found. We ... -
Analysis of multimedian problems on time dependent networks
(Bilkent University, 1994)Time dependency arises in transportation and computer-communication networks due to factors such as time varying demand, traffic intensity, and road conditions. This necessitates a locational decision to be based on an ... -
An analysis of order review
(Bilkent University, 1995)Order Review/Release (ORR) activities have mostly been ignored in past job shop research. In the majority of these studies, arriving jobs are immediately released to the shop floor without considering any information ... -
An analysis of pure robotic cycles
(Bilkent University, 2008)This thesis is focused on scheduling problems in robotic cells consisting of a number of CNC machines producing identical parts. We consider two different cell layouts which are in-line robotic cells and robot centered ... -
Analysis of reactive scheduling problems in manufacturing systems
(Bilkent University, 1997)In this study we develop a new scheduling algorithm for the job shop problem. The proposed algorithm is a heuristic method based on the filtered beam search. After extensive analyses on the evaluation functions and search ... -
Analysis of scheduling problems in dynamic and stochastic FMS environment : comparison of rescheduling polices
(Bilkent University, 2001)In this thesis, we study the reactive scheduling problems in a dynamic and stochastic flexible manufacturing environment. Specifically, we test different scheduling policies (how-to-schedule and when-to-schedule policies) ...
