Bi-Criteria Single Machine Scheduling with Rate-Modifying-Activity

Abstract

In this paper, we consider a single machine scheduling problem with two criteria: minimizing both total flow time with total tardiness and minimize maximum tardiness with number of tardy jobs. Unlike the classical scheduling problems, we use a job positio