Minimizing schedule length subject to minimum flow time

Applications and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors

Proceedings of the 1992 ACM/IEEE conference on Supercomputing

Static scheduling algorithms for allocating directed task graphs to multiprocessors

ACM Computing Surveys (CSUR)

Dynamic TCP acknowledgment in the LogP model

Journal of Algorithms

Opportunistic Scheduling Of Secure Tasks In A Multiprocessor Environment

Journal of Integrated Design & Process Science

Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints

Theoretical Computer Science

Note: Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines

Theoretical Computer Science