Answer - Topological Order!
Serial schedule will have no cycles ever present in it's equivalent graph!
Now, Topological Sorting Algorithm also works only on Directed Acyclic Graph (DAG). Therefore you do this -
1) Make sure the graph has no cycles and that's fine as they mentioned in question, guaranteed a serial schedule and yes, serial schedule will have no cycles, also they mentioned conflicts are mentioned on edges therefore you get the directions making the precedence graph as DAG
2) On this Directed Acyclic Graph, you call DFS Algorithm.
3) Now DFS always visits each vertex in the graph and in the output it produce the sequence in which DFS visited the vertices of your DAG.
4) Now, reverse the output of DFS i.e you reverse the order and you will get your topological sort.
One thing more, Topological sort is not unique!