Researcher:
Çil, Eren Başar

Profile Picture
ORCID

Job Title

Master Student

First Name

Eren Başar

Last Name

Çil

Name

Name Variants

Çil, Eren Başar

Email Address

Birth Date

Filters

2006 - 20072

Advanced Search

Filter by

Settings

Researcher Of Publications: search.filters.isAuthorOfPublication.ebc4c739-6d52-43e8-92d3-5a4da146f885

Search Results

Now showing 1 - 2 of 2
  • Placeholder
    PublicationMetadata only
    Sensitivity analysis on a dynamic pricing problem of an M/M/c queuing system
    (Elsevier, 2006) N/A; Department of Industrial Engineering; Department of Industrial Engineering; Çil, Eren Başar; Karaesmen, Fikri; Örmeci, Lerzan; Master Student; Faculty Member; Faculty Member; Department of Industrial Engineering; Graduate School of Sciences and Engineering; College of Engineering; College of Engineering; N/A; 3579; 32863
    The purpose of this article is to analyze the effects of changes in the system parameters on an M/M/c queuing system in which dynamic pricing is employed as the control policy. In order to obtain the desired results, we first describe the whole system as a combination of distinct operators. Then, we show the effects of changes in the system parameters on these operators. By using our findings on the operators we work on the sensitivity analysis of a specific queuing model both theoretically and numerically.
  • Placeholder
    PublicationMetadata only
    Structural results on a batch acceptance problem for capacitated queues
    (Springer Heidelberg, 2007) N/A; Department of Industrial Engineering; Department of Industrial Engineering; Çil, Eren Başar; Örmeci, Lerzan; Karaesmen, Fikri; Master Student; Faculty Member; Faculty Member; Department of Industrial Engineering; Graduate School of Sciences and Engineering; College of Engineering; College of Engineering; N/A; 32863; 3579
    The purpose of this paper is to investigate the structural properties of the optimal batch acceptance policy in a Markovian queueing system where different classes of customers arrive in batches and the buffer capacity is finite. We prove that the optimal policy can possess certain monotonicity properties under the assumptions of a single-server and constant batch sizes. Even though our proof cannot be extended to cases where either one of the assumptions is relaxed, we numerically observe that the optimal policy can still possess the same properties when only the single-server assumption is relaxed. Finally, we present counterexamples that show the non-monotone structure of the optimal policy when the batch sizes are not constant.