Article ID: | iaor201530628 |
Volume: | 116 |
Issue: | 3 |
Start Page Number: | 223 |
End Page Number: | 226 |
Publication Date: | Mar 2016 |
Journal: | Information Processing Letters |
Authors: | Gutin Gregory, Wahlstrm Magnus |
Keywords: | scheduling, combinatorial optimization |
The Workflow Satisfiability Problem (WSP) asks whether there exists an assignment of authorized users to the steps in a workflow specification, subject to certain constraints on the assignment. The problem is NP‐hard even when restricted to just not equal constraints. Since the number of steps