On the Complexity of Mean Flow Time Scheduling
Data up to Jan 2025
Total Citations Per Year
Abstract
References (19)
Reducibility among Combinatorial Problems
1972 • 10,743 citations
The complexity of theorem-proving procedures
1971 • 6,155 citations
The Complexity of Flowshop and Jobshop Scheduling
1976 • 2,465 citations
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
1972 • 2,450 citations
Theory of scheduling
1967 • 2,160 citations
Some simplified NP-complete graph problems
1976 • 2,051 citations
On the Computational Complexity of Combinatorial Problems
1975 • 683 citations
`` Strong '' NP-Completeness Results
1978 • 624 citations
Algorithms for Scheduling Independent Tasks
1976 • 582 citations
Scheduling independent tasks to reduce mean finishing time
1974 • 498 citations
Complexity Results for Multiprocessor Scheduling under Resource Constraints
1975 • 486 citations
Exact and Approximate Algorithms for Scheduling Nonidentical Processors
1976 • 468 citations
Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
1978 • 363 citations
Optimal Linear Ordering
1973 • 267 citations
Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
1975 • 218 citations
Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties
1972 • 140 citations
Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness
1977 • 107 citations
Optimal task sequencing with precedence constraints
1973 • 91 citations
Algorithms for Minimizing Mean Flow Time.
1974 • 31 citations