Guanqun Ni

Dr. Guanqun Ni


Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2013 in European Journal of Operational Research
Verified
Journal Article
Closed access
GNGuanqun Ni
Guanqun Ni
YXYinfeng Xu
Yinfeng Xu
YDYucheng Dong
Yucheng Dong

1 January 2015 in Electronic Commerce Research and Applications
Verified
Journal Article
Closed access
GNGuanqun Ni
Guanqun Ni
LLLi Luo
Li Luo
YXYinfeng Xu
Yinfeng Xu
JXJiuping Xu
Jiuping Xu
YDYucheng Dong
Yucheng Dong

21 February 2014 in Journal of Combinatorial Optimization
Verified
Journal Article
Closed access
PDF file
HLHongmei Li
Hongmei Li
YXYinfeng Xu
Yinfeng Xu
GNGuanqun Ni
Guanqun Ni

21 May 2018 in Journal of Combinatorial Optimization
Verified
Journal Article
Closed access
PDF file
XFXin Feng
Xin Feng
YXYinfeng Xu
Yinfeng Xu
GNGuanqun Ni
Guanqun Ni
YDYongwu Dai
Yongwu Dai

15 May 2019 in International Journal of Production Research
Verified
Journal Article
Closed access
GNGuanqun Ni
Guanqun Ni
We consider replenishment decisions on when and how many goods to purchase for a seller under a purchase-to-order mode where there is no inventory and the seller purchases goods to fulfil orders already placed. For each purchase, there is a constant ordering cost. For each order, delay cost will be incurred if it is not fulfilled timely. Generally, the more frequent the replenishment, the higher the ordering cost but the lower the delay cost. Consequently, there is a tradeoff between the ordering cost and the delay cost for the seller to make replenishment decisions minimising the total cost. In this paper, we study three cases of the problem and investigate both offline versions and online versions according to the seller's knowledge about information of future orders. For offline versions with perfect information, we either develop an optimal policy, or prove it is NP-hard and develop an approximation policy. For online versions without any information about future orders, from the perspective of competitive analysis we prove the lower bound of competitive ratio for any possible online policy and present a 10-competitive online policy for the general case and a 2-competitive online policy for each of two special cases.

13 October 2020 in IEEE Access
Verified
Journal Article
Open access
GNGuanqun Ni
Guanqun Ni
LCLei Chen
Lei Chen
Open shop scheduling problems have many practical applications, in which the jobs can be in any order with the only restriction that their durations do not overlap with each other. In some cases, the order of a subset of jobs dictates the flow shop model while the remaining jobs can be processed in any order according to the open shop model, and the corresponding problem is called mixed shop scheduling. For every job, if its processing times on all machines are the same, then the shop is called proportionate shop. In this article we investigate the three-machine proportionate open shop and mixed shop minimum makespan problems proposed by Koulamas and Kyparisis. Our result improves the previous work in three ways. First, for both the open shop and the mixed shop scheduling problems, we derive additional sufficient conditions under which the corresponding problems are solvable in polynomial time. Second, for the non-solvable cases of the open shop scheduling problem we present an improved 13/12-approximation algorithm. Third, for the non-solvable cases of the mixed shop scheduling problem we present an improved approximation algorithm with the worst-case ratio bound of (7/6 + ϵ). All the algorithms proposed in this article run in polynomial time.