A critical path generalization of the additive factor method: Analysis of a stroop task (Q1257857): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2053326249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5514188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expected Critical Path Lengths in PERT Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical-Path Planning and Scheduling: Mathematical Basis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4182234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME RESULTS CONCERNING THE IDENTIFIABILITY OF PARALLEL AND SERIAL PROCESSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Serial and within-stage independent parallel model equivalence on the minimum completion time / rank
 
Normal rank

Latest revision as of 02:17, 13 June 2024

scientific article
Language Label Description Also known as
English
A critical path generalization of the additive factor method: Analysis of a stroop task
scientific article

    Statements

    A critical path generalization of the additive factor method: Analysis of a stroop task (English)
    0 references
    1978
    0 references
    0 references
    0 references
    0 references
    0 references
    Sternberg's Additive Factor Method
    0 references
    Critical Path Method
    0 references
    Scheduling
    0 references
    Reaction Time
    0 references
    Mental Processes
    0 references
    Networks
    0 references
    Psychology
    0 references
    0 references