Endüstri Mühendisliği Bölümü Koleksiyonu

Permanent URI for this collectionhttps://hdl.handle.net/20.500.11779/1942

Browse

Filters

2014 - 20187

Settings

End date: 2019Has files: No

Search Results

Now showing 1 - 7 of 7
  • Conference Object
    Capacity Allocation and Pricing Policies for Cloud Computing Service Providers
    (Curran Associates Inc., 2018) Ünlüyurt T.; Özgür Özlük; Afghah, R.; Ünlüyurt, T.; Özlük, Ö.
    The cloud computing is regarded as a paradigm shift in today’s IT world. As cloud computing resources behave like perishable products, revenue management techniques can be applied to increase cloud service provider's total revenue. In this paper, we propose various methods for pricing and capacity allocation. We consider three types of instances offered by the service provider; subscription, on-demand and spot instances. We introduce three allocation and pricing policies and propose different models. We simulate these models on a randomly generated dataset and evaluate the models for different capacities. The results we obtain indicate the sensitivity of revenue to varying policies and demonstrate the potential profit increase for cloud service providers. © 2018, Curran Associates Inc. All rights reserved.
  • Conference Object
    Column Generation Based Algorithms for a Vrp With Time Windows & Variable Departure Times
    (2016) Michelini, S; Arda, Y; Küçükaydın, Hande
    ...
  • Conference Object
    The Traveling Salesman Problem With Time-Dependent Service Times
    (2016) Taş, Duygu
    This paper introduces a version of the classical traveling salesman problem with time-dependent service times. In our setting, the duration required to provide service to any customer is not fixed but defined as a function of the time at which service starts at that location. The objective is to minimize the total route duration, which consists of the total travel time plus the total service time. The proposed model can handle several types of service time functions, e.g., linear and quadratic functions. We describe basic properties for certain classes of service time functions, followed by the computation of valid lower and upper bounds. We apply several classes of subtour elimination constraints and measure their effect on the performance of our model. Numerical results obtained by implementing different linear and quadratic service time functions on several test instances are presented.
  • Conference Object
  • Conference Object
    Combining Acceleration Techniques for Pricing in a Vrp With Time Windows
    (2016) Michelini, S; Arda, Y; Küçükaydın, Hande
    ...
  • Conference Object
  • Conference Object
    Citation - WoS: 4
    Citation - Scopus: 4
    Perceptual Coding-Based Informed Source Separation
    (IEEE, 2014) Girin, Laurent; Kırbız, Serap; Ozerov, Alexey; Liutkus, Antoine
    Informed Source Separation (ISS) techniques enable manipulation of the source signals that compose an audio mixture, based on a coder-decoder configuration. Provided the source signals are known at the encoder, a low-bitrate side-information is sent to the decoder and permits to achieve efficient source separation. Recent research has focused on a Coding-based ISS framework, which has an advantage to encode the desired audio objects, while exploiting their mixture in an information-theoretic framework. Here, we show how the perceptual quality of the separated sources can be improved by inserting perceptual source coding techniques in this framework, achieving a continuum of optimal bitrate-perceptual distortion trade-offs.