Precedence graph

Known as: Precedence Graphs 
A precedence graph, also named conflict graph and serializability graph, is used in the context of concurrency control in databases. The precedence… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1975-2018
05101519752018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
In modern production systems, customized mass production of complex products, such as automotive or white goods, is often… (More)
  • figure 1
  • figure 2
  • figure 5
  • figure 6
  • table 1
Is this relevant?
2012
2012
Assembly line balancing problems (ALBP) consist in assigning the total workload for manufacturing a product to stations of an… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
2007
2007
Increasingly tough regulations and voluntary initiatives for the environment have pressured manufacturers to be more responsible… (More)
  • figure 1
  • table I
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
2007
2007
Reasonable task planning is the key technique to improve cooperation quality and the design efficiency in collaborative design… (More)
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
Reasoning on precedence relations is crucial for many planning and scheduling systems. In this paper we propose a double… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
The problem of nonpreemptively scheduling a set of rn partially ordered tasks on n identical processors subject to interprocessor… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1986
Highly Cited
1986
This paper presents a compact representation of all possible assembly plans of a given product using AND/OR graphs. Such a… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
1986
1986
  • Manfred Kaul
  • Graph-Grammars and Their Application to Computer…
  • 1986
Precedence graph grammars are of major interest in all those applications of graph grammars, where highly efficient parsers are… (More)
Is this relevant?
1984
1984
The existence of a schedule for a partially ordered set of unit length tasks on m identical processors is known to be NP-complete… (More)
  • figure 1
  • table 1
  • figure 2
Is this relevant?
1976
1976
The syntactical analysis of pictures derived by a context-free graph-grammar is a rather complicated algorithm. Analogously to… (More)
Is this relevant?