In this paper we introduce the concept of online tradeoff scheduling to minimize two objective functions f1 and f2 …

in scheduling theory. In contrast to the conventional models, where each task requires only one processor, we consider a …

In this paper, we consider the scheduling problem in which the jobs are first processed on a single machine and then …

in scheduling theory. In contrast to the conventional models, where each task requires only one processor, we consider a …

In this paper, we address the scheduling model with discretely compressible release dates, where processing any job … time: scheduling with discretely compressible release dates to minimize the sum of makespan plus total compression cost. We …

We consider the scheduling problem of minimizing the average weighted completion time of n jobs with release dates on a …

This paper considers a variation of the classical single machine scheduling problem with tool changes. In the variation … be processed within the first prefixed time units of a tool life. To solve the scheduling problem with small size and … moderate size, we propose two mathematical programming models. To solve the scheduling problem with large size, we propose …

A single-machine scheduling problem with workload-dependent maintenance duration is considered. The objective is to …