Entity

Time filter

Source Type


Ni G.,Xian Jiaotong University | Ni G.,Key Laboratory for Process Control and Efficiency Engineering | Xu Y.,Xian Jiaotong University | Xu Y.,Key Laboratory for Process Control and Efficiency Engineering
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2012

We introduce a model considering the single-leg revenue management problem from the perspective of online algorithms and competitive analysis. In this model, the price and limitation of bookings are both decision variables. Assuming the process of the customers meets the low-before-high manner and the expected value of customer falls in a closed interval, we analyze the upper bound for deterministic online joint pricing and booking policy and propose one optimal policy for each case. © 2012 Springer-Verlag. Source


Zhen F.,Xian Jiaotong University | Zhen F.,A+ Network | Zhen F.,Key Laboratory for Process Control and Efficiency Engineering | Liu B.,Xian Jiaotong University | And 4 more authors.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2010

This paper investigates online scheduling on m identical machines with splitting intervals, i.e., intervals can be split into pieces arbitrarily and processed simultaneously on different machines. The objective is to maximize the throughput, i.e., the total length of satisfied intervals. Intervals arrive over time and the knowledge of them becomes known upon their arrivals. The decision on splitting and assignment for each interval is made irrecoverably upon its arrival. We first show that any non-split online algorithms cannot have bounded competitive ratios if the ratio of longest to shortest interval length is unbounded. Our main result is giving an online algorithm ES (for Equivalent Split) which has competitive ratio of 2 and 2m-1/m-1 for m = 2 and m ≥ 3, respectively. We further present a lower bound of m/m-1, implying that ES is optimal as m = 2. © Springer-Verlag Berlin Heidelberg 2010. Source


Zhang W.,Xian Jiaotong University | Zhang W.,Northwest University, China | Xu Y.,Xian Jiaotong University | Xu Y.,Key Laboratory for Process Control and Efficiency Engineering | And 4 more authors.
Computers and Operations Research | Year: 2012

This work investigates the online multiple time series search problem. Given a storage with finite capability, a player receives one product for sale and observes a selling price as well at each period. With the knowledge that prices in all periods vary within [m,M] (0 Source


Zhang H.,Xian Jiaotong University | Zhang H.,Key Laboratory for Process Control and Efficiency Engineering | Xu Y.,Xian Jiaotong University | Xu Y.,Key Laboratory for Process Control and Efficiency Engineering | And 2 more authors.
Journal of Combinatorial Optimization | Year: 2013

This paper studies a variation of the online k-Canadian Traveler Problem (k-CTP), in which there are multiple travelers who can communicate with each other, to share real-time blockage information of the edges. We study two different communication levels for the problem, complete communication (where all travelers can receive and send blockage information with each other) and limited communication (where only some travelers can both receive and send information while the others can only receive information). The objective is that at least one traveler finds a feasible route from the origin to the destination with as small cost as possible. We give lower bounds on the competitive ratio for both the two communication levels. Considering the urban traffic environment, we propose the Retrace-Alternating strategy and Greedy strategy for both the two communication levels, and prove that increasing the number of travelers with complete communication ability may not always improve the competitive ratio of online strategies. © 2012 Springer Science+Business Media, LLC. Source

Discover hidden collaborations