One of the basic scheduling problems, the open-shop scheduling problem has a broad
range of applications across different sectors. The problem concerns scheduling a set of …

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 …

Scheduling and multicriteria optimisation theory have been subject, separately, to numerous
studies. Since the last twenty years, multicriteria scheduling problems have been subject to …

We aim at providing a unified framework of the common due date assignment and
scheduling problems in the deterministic case by surveying the literature concerning the …

In classical deterministic scheduling problems, it is assumed that all jobs have to be
processed. However, in many practical cases, mostly in highly loaded make-to-order …

Motivated by industrial practices, we explore in this paper the optimal supply chain
scheduling problem in garment manufacturing with the consideration of coordination and …

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 …

We study a two-echelon supply chain scheduling problem in which a manufacturer acquires
supplies from an upstream supplier and processes orders from the downstream retailers …

We review dynamic programming (DP) algorithms utilized to solve offline deterministic
single-machine scheduling problems. We classify DP algorithms based on problem …

The paper concerns the application of a non-classical performance measure, a late work
criterion (Y, Yw), to scheduling problems. It estimates the quality of the obtained solution with …