Abstract The Non-Permutation Flow-Shop scheduling problem (NPFS) is a generalization of
the traditional Permutation Flow-Shop scheduling problem (PFS) that allows changes in the …

This paper aims at presenting a compilation of state-of art references in which dynamic
programming (DP) and its variants have been applied as a solution methods for the …

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 study single machine scheduling problems with generalized due-dates. The scheduling
measure is minimum total late work. We show that unlike the classical version (assuming job …

The paper presents the first complete survey of scheduling problems with the late work
criteria. Late work objective functions estimate the quality of a schedule based on durations …

In the paper, we consider the problem of scheduling jobs on parallel identical machines with
the late work criterion and a common due date, both offline and online cases. Since the late …

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

This paper investigates a novel multi-objective model for a permutation flow shop
scheduling problem that minimizes both the weighted mean earliness and the weighted …

We consider the problem of scheduling n independent and simultaneously available jobs
without preemption on a single machine, where the machine has a fixed maintenance …

Flow shop problems as a typical manufacturing challenge have gained wide attention in
academic fields. In this paper, we consider a bi-criteria permutation flow shop scheduling …