Minimizing maximum promptness and maximum lateness on a single machine

Existence theorems, lower bounds and algorithms for scheduling to meet two objectives

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms

Simultaneously optimizing two scheduling objectives

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium

Experimental analysis of online algorithms for the bicriteria scheduling problem

Journal of Parallel and Distributed Computing

Pareto approximations for the bicriteria scheduling problem

Journal of Parallel and Distributed Computing

Experimental analysis of online algorithms for the bicriteria scheduling problem

WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms

Jackson's semi-preemptive scheduling on a single machine

Computers and Operations Research

On the existence of schedules that are near-optimal for both makespan and total weighted completion time

Operations Research Letters

Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time

Theoretical Computer Science