Query：
学者姓名：倪冠群
Refining：
Year
Type
Indexed by
Source
Complex
Co-Author
Language
Clean All
Abstract ：
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+\epsilon). All the algorithms proposed in this article run in polynomial time.
Keyword ：
Agriculture Agriculture Approximation algorithms Approximation algorithms Forestry Forestry Job shop scheduling Job shop scheduling minimum makespan minimum makespan mixed shop mixed shop Nickel Nickel open shop open shop Optimal scheduling Optimal scheduling proportionate shop proportionate shop Schedules Schedules Scheduling Scheduling
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Ni, Guanqun , Chen, Lei . Improved Scheduling for the Three-Machine Proportionate Open Shop and Mixed Shop Minimum Makespan Problems [J]. | IEEE ACCESS , 2020 , 8 : 186805-186812 . |
| MLA | Ni, Guanqun 等. "Improved Scheduling for the Three-Machine Proportionate Open Shop and Mixed Shop Minimum Makespan Problems" . | IEEE ACCESS 8 (2020) : 186805-186812 . |
| APA | Ni, Guanqun , Chen, Lei . Improved Scheduling for the Three-Machine Proportionate Open Shop and Mixed Shop Minimum Makespan Problems . | IEEE ACCESS , 2020 , 8 , 186805-186812 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
In this paper, from the perspective of game theory, we study the impact of price subsidy and fairness concern on the pricing strategies and benefits of members in the take-away industry. In the single-channel supply chain, we build a Stackelberg game model between the take-away platform and the restaurant for the online take-away business. By comparing and analyzing the product pricing and revenue in the cases of no price subsidy and price subsidy, we obtain the optimal pricing strategy for both parties. In the dual-channel supply chain, we explore the benefits of supply chain members under the combined effects of fairness concern and price subsidy. Under the single channel price subsidy model, we find that restaurant always raises prices, and the price increase is directly proportional to the subsidy intensity. Such a proper price increase always brings more benefits to both parties. Under the dual-channel model, consumer fairness concern may curb the price increase behavior of restaurants. Regardless of the model, in the long term, the optimal subsidy of the platform will decrease with the expansion of the online take-away market.
Keyword ：
Fairness concern Fairness concern Price subsidy Price subsidy Pricing strategies Pricing strategies Stackelberg game Stackelberg game Take-away Take-away
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Zhang, Hui , Luo, Kai , Ni, Guanqun . The effects of price subsidy and fairness concern on pricing and benefits of take-away supply chain [J]. | JOURNAL OF COMBINATORIAL OPTIMIZATION , 2020 , 43 (5) : 1106-1124 . |
| MLA | Zhang, Hui 等. "The effects of price subsidy and fairness concern on pricing and benefits of take-away supply chain" . | JOURNAL OF COMBINATORIAL OPTIMIZATION 43 . 5 (2020) : 1106-1124 . |
| APA | Zhang, Hui , Luo, Kai , Ni, Guanqun . The effects of price subsidy and fairness concern on pricing and benefits of take-away supply chain . | JOURNAL OF COMBINATORIAL OPTIMIZATION , 2020 , 43 (5) , 1106-1124 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
A mixed shop is a manufacturing infrastructure designed to process a mixture of a set of flow-shop jobs and a set of open-shop jobs. Mixed shops are in general much more complex to schedule than flow-shops and open-shops, and have been studied since the 1980's. We consider the three machine proportionate mixed shop problem denoted as M3 vertical bar prpt vertical bar C-max, in which by "proportionate" each job has equal processing times on all three machines. Koulamas and Kyparisis (2015) [6] showed that the problem is solvable in polynomial time in some very special cases; for the non-solvable case, they proposed a 5/3-approximation algorithm. In this paper, we first present an improved 4/3-approximation algorithm and show that this ratio of 4/3 is asymptotically tight; when the largest job is a flow-shop job, we then present a fully polynomial-time approximation scheme (FPTAS). On the negative side, while the F3 vertical bar prpt vertical bar C-max problem is polynomialtime solvable, we show an interesting hardness result that adding one open-shop job to the job set makes the problem NP-hard if this open-shop job is larger than any flow-shop job. We are able to design an FPTAS for this special case too. (C) 2019 Elsevier B.V. All rights reserved.
Keyword ：
Approximation algorithm Approximation algorithm Fully polynomial-time approximation scheme Fully polynomial-time approximation scheme Mixed shop Mixed shop Proportionate Proportionate Scheduling Scheduling
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Liu, Longcheng , Chen, Yong , Dong, Jianming et al. Approximation algorithms for the three-machine proportionate mixed shop scheduling [J]. | THEORETICAL COMPUTER SCIENCE , 2020 , 803 : 57-70 . |
| MLA | Liu, Longcheng et al. "Approximation algorithms for the three-machine proportionate mixed shop scheduling" . | THEORETICAL COMPUTER SCIENCE 803 (2020) : 57-70 . |
| APA | Liu, Longcheng , Chen, Yong , Dong, Jianming , Goebel, Randy , Lin, Guohui , Luo, Yue et al. Approximation algorithms for the three-machine proportionate mixed shop scheduling . | THEORETICAL COMPUTER SCIENCE , 2020 , 803 , 57-70 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
We consider a room allocation problem for a hotel providing room reservation service through multiple channels. Traditional room allocation models usually assume hotels can forecast the characteristics of demand function and/or arrival process to some extent. But in practice, such a restrictive assumption is possibly unrealistic, and thus the corresponding risk-neutral approaches are debatable. The main contribution of this paper is that we formulate the hotel’s room allocation problem without any assumption on demand from the perspective of minimax regret and derive an adaptive nested limits strategy which allows higher profitable channels having access to all rooms reserved for lower profitable channels. Our results show that customers arrive in a low-before-high manner in the worst-case scenarios. On this basis, we further prove the lower bound of maximum regret for any strategy and develop an optimal strategy matching the lower bound. Comparison with other common strategies is also discussed. © 2019 Northeastern University, China.
Keyword ：
Functions Functions Hotels Hotels Profitability Profitability Risk perception Risk perception
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Ni, Guanqun , Feng, Xin , Chen, Lei . Hotel room allocation with multiple sales channels: a perspective of minimax regret [J]. | Journal of Control and Decision , 2020 , 7 (4) : 359-378 . |
| MLA | Ni, Guanqun et al. "Hotel room allocation with multiple sales channels: a perspective of minimax regret" . | Journal of Control and Decision 7 . 4 (2020) : 359-378 . |
| APA | Ni, Guanqun , Feng, Xin , Chen, Lei . Hotel room allocation with multiple sales channels: a perspective of minimax regret . | Journal of Control and Decision , 2020 , 7 (4) , 359-378 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
考虑不同类型消费者对消费限制的感知成本存在差异,从收益最大化的角度,分别构建了统一价格策略和歧视价格策略的优化模型,通过对比分析,给出了两类价格策略的占优条件和最优价格策略,在占优的市场条件下,分析了歧视价格策略对销售收益、市场需求、经济剩余的影响。研究发现:只有当消费限制感知成本高的消费者规模足够大或者价格敏感性足够低时,销售商才有可能通过歧视价格策略改善销售收益;两类消费者的消费限制感知成本差异对最优歧视价格的销售收益有正向作用,但是当感知成本差异超过一定上限时,对销售收益的影响将保持不变;在特定市场条件下,歧视价格策略对两类消费者的需求和消费者剩余有相反的影响,而在某些条件下,歧视价格策略对两类消费者的需求和消费者剩余都有正向影响。
Keyword ：
价格歧视 价格歧视 异质需求 异质需求 收益最大化 收益最大化 消费限制 消费限制 经济剩余 经济剩余
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 倪冠群 . 基于消费限制的歧视价格决策及其效应分析 [J]. | 运筹与管理 , 2020 , 29 (11) : 93-101 . |
| MLA | 倪冠群 . "基于消费限制的歧视价格决策及其效应分析" . | 运筹与管理 29 . 11 (2020) : 93-101 . |
| APA | 倪冠群 . 基于消费限制的歧视价格决策及其效应分析 . | 运筹与管理 , 2020 , 29 (11) , 93-101 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
在服务商为不同偏好顾客提供差异性服务的排队系统中,其收益受到需求规模、顾客类型等因素影响,如何制定策略才能达到服务特定类型顾客并获取最大收益的目的?本文以服务时间与效果正相关的顾客密集型服务为背景,基于M/M/1模型对服务商为两种偏好顾客提供两种服务的情景进行研究,并将从偏好服务所获基准效用相对较低、较高的顾客分别定义为1类、2类顾客。结果表明,①随着潜在顾客规模的增加,最优策略所适用的3种基本策略依次为公平策略、优先服务2类顾客的策略以及仅服务2类顾客的排他性策略;②3种基本策略的适用范围仅与1类顾客的服务选择标准相关;③在优先服务某类顾客的策略中,有效到达速率及服务速度由另一类顾客的特征决定。
Keyword ：
M/M/1排队模型 M/M/1排队模型 定价 定价 差异性顾客 差异性顾客 服务运作 服务运作 服务速度 服务速度
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 李武强 , 倪冠群 , 许晓晴 . 基于排队系统的偏好差异性顾客服务策略分析 [J]. | 运筹与管理 , 2020 , 29 (08) : 89-97 . |
| MLA | 李武强 et al. "基于排队系统的偏好差异性顾客服务策略分析" . | 运筹与管理 29 . 08 (2020) : 89-97 . |
| APA | 李武强 , 倪冠群 , 许晓晴 . 基于排队系统的偏好差异性顾客服务策略分析 . | 运筹与管理 , 2020 , 29 (08) , 89-97 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
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.
Keyword ：
approximation algorithms approximation algorithms competitive analysis competitive analysis online algorithms online algorithms purchase-to-order purchase-to-order purchasing purchasing replenishment planning replenishment planning
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Ni, Guanqun . Replenishment policy for a purchase-to-order seller: a tradeoff between ordering cost and delay cost [J]. | INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH , 2019 , 58 (4) : 1239-1254 . |
| MLA | Ni, Guanqun . "Replenishment policy for a purchase-to-order seller: a tradeoff between ordering cost and delay cost" . | INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 58 . 4 (2019) : 1239-1254 . |
| APA | Ni, Guanqun . Replenishment policy for a purchase-to-order seller: a tradeoff between ordering cost and delay cost . | INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH , 2019 , 58 (4) , 1239-1254 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
With the competition becoming more fiercer in the online take-away industry, it is a key issue to achieve a win-win situation for both parties, i.e., the take-away platform and the restaurant. In this paper, we establish a Stackelberg game model for the online take-away business, and derive the optimal pricing strategies for both parties under two main scenarios with and without price subsidy, respectively. By comparing the two scenarios, we find that the restaurant will always increase the sales price under the scenario with price subsidy, when the subsidy threshold is not too high. Moreover, the increased price is proportional to the subsidy intensity, and can always bring more benefits for both parties.
Keyword ：
Online Delivery Online Delivery Price Subsidy Price Subsidy Pricing Pricing Revenue Revenue Stackelberg Game Stackelberg Game
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Luo, Kai , Ni, Guanqun . The Effects of Price Subsidy on Take-away Pricing and Revenue [J]. | PROCEEDINGS OF THE 2019 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM 2019) , 2019 : 866-870 . |
| MLA | Luo, Kai et al. "The Effects of Price Subsidy on Take-away Pricing and Revenue" . | PROCEEDINGS OF THE 2019 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM 2019) (2019) : 866-870 . |
| APA | Luo, Kai , Ni, Guanqun . The Effects of Price Subsidy on Take-away Pricing and Revenue . | PROCEEDINGS OF THE 2019 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM 2019) , 2019 , 866-870 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Group buying (GB) is a popular business model in e-commerce. With the rise of online social media, the positive network effect of buying with others is more important than price discount for consumers to choose GB. However, the negative network effect of GB is also significant for some consumers. In this paper, we classify consumers into two segments considering both positive and negative network effects, and three possible sales strategies as well as their optimal decisions on price are presented. We find that GB strategy dominates individual buying (IB) strategy when the positive network effect is sufficiently high or the proportion of consumers with low valuation is relatively large. We also find that MIX strategy offering both IB and GB is always better than IB, while the relationship between MIX and GB is depending on actual market situations. Some other managerial insights are also discussed.
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Ni, Guanqun . A pricing model for group buying based on network effects [J]. | PLOS ONE , 2019 , 14 (1) . |
| MLA | Ni, Guanqun . "A pricing model for group buying based on network effects" . | PLOS ONE 14 . 1 (2019) . |
| APA | Ni, Guanqun . A pricing model for group buying based on network effects . | PLOS ONE , 2019 , 14 (1) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
This paper studies an online revenue management problem of accepting and assigning two classes of customers to two levels of resources with capacity constraints. A customer's request may be either accepted or rejected immediately upon its arrival without the information of further demand. One class of customers can be served either by a low-level resource at the resource's regular price, or by a high-level resource at the customer's reservation price. Another class of customers can be served by either level of resource at the regular price of the corresponding resource. Given the capacities of both levels of resources, the objective is to accept appropriate customers and assign them to appropriate resources so as to maximize the total revenue. From the perspective of competitive analysis, we derive an upper bound of competitive ratio for the problem and develop an optimal online strategy whose competitive ratio matches the upper bound. (C) 2018 Elsevier B.V. All rights reserved.
Keyword ：
Competitive analysis Competitive analysis Hierarchical resources Hierarchical resources On-line algorithms On-line algorithms Revenue management Revenue management
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Ni, Guanqun , Zheng, Feifeng , Xu, Yinfeng . Competitive analysis of online revenue management with hierarchical resources [J]. | INFORMATION PROCESSING LETTERS , 2019 , 142 : 41-45 . |
| MLA | Ni, Guanqun et al. "Competitive analysis of online revenue management with hierarchical resources" . | INFORMATION PROCESSING LETTERS 142 (2019) : 41-45 . |
| APA | Ni, Guanqun , Zheng, Feifeng , Xu, Yinfeng . Competitive analysis of online revenue management with hierarchical resources . | INFORMATION PROCESSING LETTERS , 2019 , 142 , 41-45 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Export
| Results： |
Selected to |
| Format： |
