Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

M. I. Dessouky

dblp:41/6091 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1981
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 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
1 paper
Mathematical optimization · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization › integer programming
branch-and-bound		 0.011981
Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time · SIAM J. Comput. 1981
Mathematical optimization
combinatorial optimization		 0.011981
Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time · SIAM J. Comput. 1981
Mathematical optimization
scheduling		 0.011981
Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time · SIAM J. Comput. 1981
Mathematical optimization › scheduling › machine scheduling
single-machine scheduling		 0.011981
Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time · SIAM J. Comput. 1981
Mathematical optimization › scheduling › flow time minimization
mean flow time minimization		 0.011981
Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time · SIAM J. Comput. 1981

Methods — techniques the papers use, named apart from their topics

lower bound · 0.0implicit enumeration · 0.0branch-and-bound · 0.0
YearPublicationVenuePosition
1981 Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time
abstract
This paper presents a procedure for sequencing a set of jobs on a single processor (machine) with the objective of minimizing the mean flow time, when the jobs may have unequal ready times. The procedure involves implicit enumeration with the branch and bound technique, coupled with some devices to improve the efficiency of the search. The devices include a sufficient optimality condition, a simple but tight lower bound and rules for tree pruning. The approach has potential applications to other sequencing problems.
M. I. Dessouky, Jitender S. Deogun
 SIAM J. Comput.1