Switching Times from Season to Single Tickets

2010-09-03
Yakici, Ertan
Duran, Serhan
In this paper, we developed the basic problem with only one switch from selling bundles to selling single tickets to a new version where “early switch to the low-demand event” is also allowed. The resulting policy is defined by a set of threshold pairs of times and remaining inventory, which determine the timing of the optimal switches.

Suggestions

An optimal procedure for the coordinated replenishment dynamic lot-sizing problem with quantity discounts
Chung, CS; Hum, SH; Kirca, O (2000-12-01)
We consider in this paper the coordinated replenishment dynamic lot-sizing problem when quantity discounts are offered. In addition to the coordination required due to the presence of major and minor setup costs, a separate element of coordination made possible by the offer of quantity discounts needs to be considered as well. The mathematical programming formulation for the incremental discount version of the extended problem and a tighter reformulation of the problem based on variable redefinition are pro...
Uniqueness of the reserve price with asymmetric bidders
Günay, Hikmet; Meng, Xin; Nagelberg, Mark (Orta Doğu Teknik Üniversitesi (Ankara, Turkey), 2016-8)
We analyze the optimal reserve price in a second price auction when there are 𝑁 types of bidders whose valuations are drawn from different distribution functions. The seller cannot determine the specific “distribution type” of each bidder. In this paper, we give sufficient conditions for the uniqueness of the optimal reserve price. Then, we give sufficient conditions that ensure the seller will not use a reserve price; hence, the auction will be efficient.
A multi-phase heuristic for the production routing problem
Solyali, Oguz; Süral, Haldun (2017-11-01)
This study considers the production routing problem where a plant produces and distributes a single item to multiple retailers over a multi-period time horizon. The problem is to decide on when and how much to produce and stock at the plant, when and how much to serve and stock at each retailer, and vehicle routes for shipments such that the sum of fixed production setup cost, variable production cost, distribution cost, and inventory carrying cost at the plant and retailers is minimized. A multi-phase heur...
A Branch-and-Cut Algorithm Using a Strong Formulation and an A Priori Tour-Based Heuristic for an Inventory-Routing Problem
Solyali, Oguz; Süral, Haldun (2011-08-01)
We address a vendor-managed inventory-routing problem where a supplier ( vendor) receives a given amount of a single product each period and distributes it to multiple retailers over a finite time horizon using a capacitated vehicle. Each retailer faces external dynamic demand and is controlled by a deterministic order-up-to level policy requiring that the supplier raise the retailer's inventory level to a predetermined maximum in each replenishment. The problem is deciding on when and in what sequence to v...
Cyclic ordering policies from capacitated suppliers under limited cycle time
EKİCİ, ALİ; Ozener, Okan Orsan; Duran, Serhan (Elsevier BV, 2019-02-01)
In this paper, we study the ordering policy of a manufacturer/retailer which procures a single item from multiple capacitated suppliers and satisfies an exogenous deterministic and constant demand. Manufacturer's objective is to minimize total periodic ordering cost which has three components: (i) fixed ordering cost, (ii) variable purchasing cost, and (iii) inventory holding cost. We are interested in developing a cyclic ordering policy for the manufacturer where the orders are repeated with a certain freq...
Citation Formats
E. Yakici and S. Duran, “Switching Times from Season to Single Tickets,” 2010, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/46384.