Title :
Precedence constraints and tasks: how many task orderings?
Author :
Miller, Joseph M. ; Stockman, George C.
Abstract :
An improved algorithm for determining the number of task orderings for a set of tasks and precedence constraints is presented. Precedence graphs are used to represent the tasks and constraints. A subgraph replacement strategy acts as an oracle in determining the exact number of task orderings for a class of NX-fold graphs. For non-NX-fold graphs the oracle computes, in low-order polynomial time, bounds on the number of orders
Keywords :
assembling; graph theory; production control; NX-fold graphs; assembly; polynomial time; precedence constraints; precedence graphs; production control; subgraph replacement strategy; task orderings;
Conference_Titel :
Systems Engineering, 1990., IEEE International Conference on
Conference_Location :
Pittsburgh, PA, USA
Print_ISBN :
0-7803-0173-0
DOI :
10.1109/ICSYSE.1990.203183
