J
Jianhui Xie
Researcher at Sun Yat-sen University
Publications - 15
Citations - 490
Jianhui Xie is an academic researcher from Sun Yat-sen University. The author has contributed to research in topics: Data envelopment analysis & Cost efficiency. The author has an hindex of 6, co-authored 14 publications receiving 339 citations. Previous affiliations of Jianhui Xie include University of Science and Technology of China.
Papers
More filters
Journal ArticleDOI
DEA Models for Extended Two-Stage Network Structures
TL;DR: Two models are proposed to evaluate the performance of this type general two-stage network structures where all outputs of the first stage are the only inputs to the second stage, and a non-cooperative model, in which one of the stages is regarded as the leader and the other is the follower.
Journal ArticleDOI
Sustainability assessment of inland transportation in China: A triple bottom line-based network DEA approach
TL;DR: Li et al. as mentioned in this paper proposed a network data envelopment analysis (DEA) measure, which organizes the three components of the system into a parallel structure, allocates shared input across subsystems, and incorporates undesirable output.
Journal ArticleDOI
Estimation of potential gains from bank mergers: A novel two-stage cost efficiency DEA model
TL;DR: A novel two-stage cost efficiency model to estimate and decompose the potential gains from Mergers and Acquisitions (M&As) is developed and it is concluded that there exist considerably potential gains for the proposed merged banks.
Journal ArticleDOI
Super efficiency evaluation using a common platform on a cooperative game
TL;DR: The Shapley value is introduced as a solution of this cooperative game and applied to rank efficient DMUs and is extended to the VRS assumption to address the multi-platform problem from the perspective of a cooperative game.
Journal ArticleDOI
A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes
TL;DR: A genetic algorithm based on random-keys encoding is proposed to solve the problem of minimizing makespan on unrelated parallel BPMs with non-identical job sizes and arbitrary release times.