1. A method for optimizing data archive management scheduling, said method comprising: modeling, by a processor of a computer system, a flow network, wherein said modeling the flow network comprises creating vertexes organized in multiple levels and creating multiple edges sequentially connecting the vertexes of the multiple levels, wherein the multiple levels consist of N+1 levels denoted as LEVEL 0 , LEVEL 1 ,. .. , LEVEL N , wherein N is at least 2, wherein LEVEL 0 comprises a source vertex, wherein each level of LEVEL 0 , LEVEL 1 ,. .. , LEVEL N comprises at least one task vertex associated with at least one archive management task, wherein EDGE K is directed from the vertex of LEVEL K−1 to the vertex of LEVEL K for K=1,. .. , N, wherein EDGE 1 indicates that a first archive management task associated with a first task vertex of LEVEL 1 is scheduled by a job scheduler, and wherein EDGE 1 has a first weight equal to a time unit to perform the first archive management task, wherein an optimal path in the flow network represents an optimal initial schedule; receiving, by the processor, monitoring results of operations of the optimal initial schedule for a worker program of the computer system, wherein the worker program performs archive management tasks according to the optimal initial schedule; creating, by the processor, an adjusted schedule by dynamically optimizing a scheduling order of the archive management tasks based on the received monitoring results; and performing, by the worker program, the archive management tasks according to the adjusted schedule.