摘要: We study whether the executions of a time-annotated sound workflow graph (WFG) meet a given deadline when an unbounded number of resources (i.e., executing agents) is available. We present polynomialtime algorithms and NP-hardness... 展开
作者 | Mirela Botezatu Hagen Volzer Lothar Thiele | ||
---|---|---|---|
作者单位 | |||
文集名称 | Business process management | ||
出版年 | 2016 | ||
出版社/出版地 | Springer / Berlin | ||
会议名称 | International Conference on Business Process Management | ||
开始页/总页数 | 252 / 17 | ||
会议日期/会议地点 | 20160918-22 / Rio de Janeiro | 会议年/会议届次 | 2016 / 14th |
中图分类号 | TP311.5-53 | ||
馆藏号 | N2016122800250367 |