Single machine scheduling problems with release dates
Abstract
The single machine scheduling problems have been extensively studied with various criteria to be optimized and under various assumptions. In this work, we review some results obtained recently in the case of different release dates. Most problems with different release dates are NP-hard. Some researchers have proved some dominance properties or sufficient conditions for local optimality which lead to an optimal schedule in some specificic cases. We present some properties or conditions for two regular criteria, total tardiness and total flow time.