Workflow management systems allow for visibility, control, and automation of many business processes. Recently, nonbusiness domains have taken an interest in the management of workflows, and the optimal assignment and scheduling of workflow tasks to users across a network. This research aims at developing a rigorous mathematical programming formulation of the workflow optimization problem. The resulting formulation is nonlinear, but a linearized version is produced. Three heuristics are developed to find solutions efficiently. Computational experiments are presented and analyzed, comparing solutions to the original linearized formulation with the three heuristics.
[1]
Giorgio Gambosi,et al.
Complexity and Approximation
,
1999,
Springer Berlin Heidelberg.
[2]
Irina S. Dolinskaya,et al.
Multi-depot vessel routing problem in a direction dependent wavefield
,
2014,
J. Comb. Optim..
[3]
Mani B. Srivastava,et al.
Topology management for sensor networks: exploiting latency and density
,
2002,
MobiHoc '02.
[4]
Biswanath Mukherjee,et al.
Wireless sensor network survey
,
2008,
Comput. Networks.
[5]
Panos M. Pardalos,et al.
Speeding up continuous GRASP
,
2010,
Eur. J. Oper. Res..