Abstract
In virtually any practical field or application, discovering and implementing near-optimal decision strategies is essential for achieving desired outcomes. Workflow planning is one of the most common and important problems of this kind, as sub-optimal decision-making may create bottlenecks and delays that decrease efficiency and increase costs. Recently, machine learning has been used to attack this problem, but unfortunately, most proposed solutions are “black box” algorithms with underlying logic unclear to humans. This makes them hard to implement and impossible to trust, significantly limiting their practical use. In this work, we propose an alternative approach: using machine learning to generate optimal, comprehensible strategies which can be understood and used by humans directly. Through three common decision-making problems found in scheduling, we demonstrate the implementation and feasibility of this approach, as well as its great potential to attain near-optimal results.
Publisher
Public Library of Science (PLoS)
Reference39 articles.
1. Characterizing the Manufacturing Scheduling Problem;H. D. Parunak;Journal of Manufacturing Systems,1991
2. Distributed Manufacturing Scheduling Using Intelligent Agents;W. Shen;IEEE Intelligent Systems,2002
3. A Distributed Genetic Algorithm for Deterministic and Stochastic Labor Sheduling Poblems;F. F. Easton;European Journal of Operational Research,1999
4. Employee Scheduling with Short Demand Perturbations and Extensible Shifts;R. Bürgy;Omega,2019
5. "Linear Programming," Wikipedia, [Online]. Available: https://en.wikipedia.org/wiki/Linear_programming. [Accessed 23 11 2020].
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献