Optimal scheduling for two-processor systems

1972/09/01 by E. G. Coffman, Ronald Graham, R. L. Graham · 6 citations
Computer Science · Engineering · #Interconnection Networks and Systems #Optimization and Search Problems #Scheduling and Optimization Algorithms

paper · doi:10.1007/bf00288685

crossref issued 1972/09/01 · crossref published 1972/09/01 · crossref published-print 1972/09/01 · openalex publication_date 1972/09/01 · crossref created 2004/10/05 · crossref deposited 2020/02/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28 · crossref indexed 2026/07/28

Citations

• Paths, Trees, and Flowers

Cited by

• The Transitive Reduction of a Directed Graph
• `` Strong '' NP-Completeness Results
• Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
• Drawing Graphs with GLEE
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Generating and characterizing the perfect elimination orderings of a chordal graph
• Algorithmic Aspects of Vertex Elimination on Graphs