The paper presents the survey of scheduling problems with the criteria based on early and
late work. Early and late work corresponds to the size of a job executed before and after its …

We consider non-preemptive online parallel-machine scheduling with a common due date
to maximize the total early work of all the jobs, ie, the total processing time of the jobs (or …

Scheduling with a due date (Gordon et al., 2002) or a due window (Janiak et al., 2013)
characterizes the time accuracy in a real production environment. Among them, early work …

This paper considers scheduling in a two-machine flow shop to maximize the total early
work subject to a common due date. The early work of a job is a parameter defined as the …

We study a scheduling problem with a given number of identical parallel machines, a
common job due date and the total early work criterion, ie, P m| dj= d| max {X}, which is …

We study the early work scheduling problem on identical parallel machines in order to
maximize the total early work, ie, the parts of non-preemptive jobs that are executed before a …

We consider the total weighted early work maximization problem on identical machines in
parallel such that the weights are identical, or the due date is the same. First, we present an …

In this article, we study a parallel machine scheduling problem with a common due date to
maximize total weighted early work. We present the first EPTAS (efficient polynomial time …

Project resource levelling is very important and project managers need a schedule based on
the optimal use of resources needed to complete their projects. Most resource levelling …

This paper mainly focuses on a resource leveling variant of a two-processor scheduling
problem. The latter problem is to schedule a set of dependent UET jobs on two identical …