Date of Award

6-29-1999

Document Type

Thesis (Undergraduate)

Department

Department of Computer Science

First Advisor

Cliff Stein

Abstract

We will look at the existence of schedules which are simultaneously near-optimal for two criteria. First, we will present some techniques for proving existence theorems, in a very general setting, for bicriterion scheduling problems. We will then use these techniques to prove existence theorems for a large class of problems. We will consider the relationship between objective functions based on completion time, flow time, lateness and the number of on-time jobs. We will also present negative results first for the problem of simultaneously minimizing the maximum flow time and average weighted flow time and second for minimizing the maximum flow time and simultaneously maximizing the number of on-time jobs. In some cases we will also present lower bounds and algorithms that approach our bicriterion existence theorems. Finally we will improve upon our general existence results in one more specific environment.

Comments

Originally posted in the Dartmouth College Computer Science Technical Report Series, number PCS-TR99-347.

Share

COinS