Single machine scheduling problems with release dates - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1990

Single machine scheduling problems with release dates


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.
Fichier principal
Vignette du fichier
RR-1232.pdf (1.12 Mo) Télécharger le fichier

Dates and versions

inria-00075326 , version 1 (24-05-2006)


  • HAL Id : inria-00075326 , version 1


Chengbin Chu, Marie-Claude Portmann. Single machine scheduling problems with release dates. [Research Report] RR-1232, INRIA. 1990, pp.22. ⟨inria-00075326⟩
84 View
39 Download


Gmail Facebook Twitter LinkedIn More