A Novel Coevolutionary Approach to Reliability Guaranteed Multi-Workflow Scheduling upon Edge Computing Infrastructures

Table 1

Notations and description.

Notation	Description
N	The total number of workflows
M	The total number of edge servers
	The reliability of the workflow
	The selection probability for a task
	A boolean variable indicating whether is selected for a task
ST	The start time of the task on
	The mean time-to-failure of the server p
D	User-defined deadline of the workflow i
pred	All predecessor node tasks of in the workflow i
	The coverage area of the server
	The total number of tasks in the workflow
	The total number of virtual machines in the server
	The success rate of the task
	The task executed on
	The execution time of the task on
FT	The completion time of the task on
prior	The prior task of in the execution queue of
T	The finish time of the workflow i
	The distance between the server and device i
–	–