6 citations · 6 across the 1 of their papers we have counts for
1 paper
A. I. Pakhomchik, S. Yudin, M. R. Perelshtein +2
In this paper we investigate the workflow scheduling problem, a known NP-hard class of scheduling problems. We derive problem instances from an industrial use case and compare agai…