Synthesizing partial orders given comparability information: Partitive sets and slack in critical path networks

DOI10.1016/0022-2496(83)90010-XzbMath0538.92025MaRDI QIDQ793664

Richard Schweickert

Publication date: 1983

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)

zbMATH Keywords

comparability graphdirected acyclic graphslacksreaction timescritical path networkcharacterization of weakly connected subgraphscognitive tasksmental activitiespartitive setstransitive orientation algorithm

Mathematics Subject Classification ID

Partial orders, general (06A06) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Mathematical psychology (91E99)

Related Items

Two topics in tree inference: locating a phonological network effect in immediate recall and arborescence partitive set form, Constructing a stochastic critical path network given the slacks: Representation, Additive factors and stages of mental processes in task networks, Toward the trichotomy method of reaction times: Laying the foundation of stochastic mental networks, A trichotomy: Interactions of factors prolonging sequential and concurrent mental processes in stochastic discrete mental (PERT) networks, Stochastic networks as models of cognition: Derivation of response time distributions using the order-of-processing method

Cites Work

• Unnamed Item
• Unnamed Item
• Stochastic PERT networks as models of cognition: Derivation of the mean, variance, and distribution of reaction time using order-of-processing (OP) diagrams
• Comparability graphs and a new matroid
• Serial and within-stage independent parallel model equivalence on the minimum completion time
• A critical path generalization of the additive factor method: Analysis of a stroop task
• The bias of an estimate of coupled slack in stochastic PERT networks
• Partially ordered sets and their comparability graphs
• The Dimension of a Comparability Graph
• Transitive Orientation of Graphs and Identification of Permutation Graphs
• SOME RESULTS CONCERNING THE IDENTIFIABILITY OF PARALLEL AND SERIAL PROCESSES
• A Characterization of Comparability Graphs and of Interval Graphs