Demo Data from VLDB 2026 / reviewers in the wild / expert
James O. Achugbue
dblp:16/3566
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 1982
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
2 papers |
Mathematical optimization · 80% Computational complexity · 20% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Parallel and multicore computing · 56% Electronic design automation · 44% |
Topics — the 7 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Mathematical optimization
scheduling |
0.0 | 2 | 1982 | Scheduling the Open Shop to Minimize Mean Flow Time · SIAM J. Comput. 1982 Bounds on Schedules for Independent Tasks with Similar Execution Times · J. ACM 1981 |
Mathematical optimization › scheduling › shop scheduling
open shop scheduling |
0.0 | 1 | 1982 | Scheduling the Open Shop to Minimize Mean Flow Time · SIAM J. Comput. 1982 |
Parallel and multicore computing › parallel scheduling
list scheduling |
0.0 | 1 | 1981 | Bounds on Schedules for Independent Tasks with Similar Execution Times · J. ACM 1981 |
Electronic design automation › high-level synthesis
scheduling |
0.0 | 1 | 1981 | Bounds on Schedules for Independent Tasks with Similar Execution Times · J. ACM 1981 |
Mathematical optimization › scheduling › completion time minimization
makespan minimization |
0.0 | 1 | 1981 | Bounds on Schedules for Independent Tasks with Similar Execution Times · J. ACM 1981 |
Mathematical optimization › scheduling › flow time minimization
mean flow time minimization |
0.0 | 1 | 1982 | Scheduling the Open Shop to Minimize Mean Flow Time · SIAM J. Comput. 1982 |
Parallel and multicore computing › parallel scheduling
independent task scheduling |
0.0 | 1 | 1981 | Bounds on Schedules for Independent Tasks with Similar Execution Times · J. ACM 1981 |
Methods — techniques the papers use, named apart from their topics
worst-case analysis · 0.0list scheduling · 0.0shortest processing time heuristic · 0.0NP-completeness reduction · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1982 | Scheduling the Open Shop to Minimize Mean Flow TimeabstractIt is shown that the problem of scheduling a two-processor n-job open shop nonpreemptively in order to minimize mean flow time is NP-complete even if input length is measured by the sum of the task lengths. The proof is similar in approach to that used by Garey, Johnson and Sethi to show NP-completeness of the two-processor flow shop mean flow problem. We assume previous results from their paper where possible and concentrate on those elements of the proof that are distinct from theirs. In addition, bounds are derived for the mean flow times of arbitrary and shortest processing time (SPT) first schedules for m-processor n-job systems in terms of the mean flow time of an optimal schedule. James O. Achugbue, Francis Y. L. Chin |
SIAM J. Comput. | 1 |
| 1981 | Bounds on Schedules for Independent Tasks with Similar Execution TimesabstractAn open problem by Graham is solved.The problem considered is that of scheduling a set of n independent tasks nonpreemptively on m identical processors to minimize finish time.Let a.,o and ~o be the finish times of an optimal schedule and an arbitrary list schedule, respectively.The worst possible behavior of o~/w0 for tasks with similar execution times is investigated. KEY WORDS AND PHRASES: minimal length James O. Achugbue, Francis Y. L. Chin |
J. ACM | 1 |