Application of Greedy Algorithm in Solving Service Prioritization
- 10.2991/amcce-17.2017.39How to use a DOI?
- greedy algorithm,response radio,service order,optimal sub-structure,local optimal solution
Nowadays,there is an increasingly hot topic among the academia which concerns the exiquisite place that algorthm produce.A superior algorithm can not only soup up one thing, but also maximize the benefits and generate the smallest overhead.The kinds of algorithms abounds,such as dynamic programming method,greedy algorithm and backtracking method.As is shown in this paper,the issue of customer service priorities,to make arrangements for the priority of service , allow all customers to wait for the shortest time.The solutions to this problem overflow,first come first service,the shortest service first,for example.but all these don't very well in meeting the real needs.Using the greedy algorithms ,the response radio as the primary consideration to solve the problem , is a very simple but effective results of the method.
- © 2017, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - ChengYu Luo PY - 2017/03 DA - 2017/03 TI - Application of Greedy Algorithm in Solving Service Prioritization BT - Proceedings of the 2017 2nd International Conference on Automation, Mechanical Control and Computational Engineering (AMCCE 2017) PB - Atlantis Press SP - 230 EP - 233 SN - 2352-5401 UR - https://doi.org/10.2991/amcce-17.2017.39 DO - 10.2991/amcce-17.2017.39 ID - Luo2017/03 ER -