You are presented with multiple paper abstracts, alongside the associated literature review and chapter titles. Given the provided information, you are going to do a literature review. Please generate a coherent literature review that synthesizes the content, draws connections between different works, highlights major findings, and identifies any gaps in the existing research.

Literature Review Title: A survey on how the structure of precedence constraints may change the complexity class of scheduling problems 
Chapter Title:  15 
1. Abstract of Cited Paper (BIB001):  Linear-time algorithms are presented for several problems of scheduling n equal-length tasks on m identical parallel processors subject to precedence constraints. This improves upon previous time bounds for the maximum lateness problem with treelike precedence constraints, the number-of-late-tasks problem without precedence constraints, and the one machine maximum lateness problem with general precedence constraints. 
2. Abstract of Cited Paper (BIB002):  Ordered sets have recently gained much importance in many applied and theoretical problems in computer science and operations research ranging from project planning via processor scheduling to sorting and retrieval problems. These problems involve partial orders as their basic structure, e.g. as precedence constraints in scheduling problems, or as comparability relation among the objects to be sorted or retrieved.

Literature Review:
In BIB003 , the author studies the problem with bounded width, equal processing times and the makespan criterion. He shows that the problem can be solved in polynomial time by using dynamic programming on the digraph of order ideals.  proposed their own approach to solve the problem P |w(G) ≤ k, r j , p j = 1|f for any regular function f . More precisely, their algorithm consists in searching a shortest path in the related transversal graph. When adding release dates, the problem is already N P-hard for intrees, yet it is solvable in polynomial time for outtrees (see , and BIB002 for a linear algorithm for the latter problem). Note that there is a strong relationship between scheduling with release dates and Cmax criterion and scheduling with Lmax, by simply looking at the schedule in the reverse way, and reversing the precedence constraints. Hence problems P |intree, p j = p|Lmax is polynomially solvable and P |outtree, p j = p|Lmax is N P-hard. Kubiak et al. [2009] recently opened new perspectives, since they show that P |DC −graph, p j = p|Cmax is solvable in polynomial time. They more precisely proved that the Highest Level First strategy (used in BIB001 ) solves the problem to optimality when the precedence graph is a divide-and-conquer graph (see Definition 3).