Transaction sequencing problems for maximal parallelism

The authors define the maximal parallelism scheduling problem and prove that it is NP hard. They examine a special case of the problem and find its nearly optimal solution in the succeeding section. The main techniques for finding an approximate solution are grouping of transactions and defining an order within each group. Moreover they define group of groups (higher level group) and improve approximation using it