Skip to Main content Skip to Navigation
Reports

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.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00075326
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 5:58:36 PM
Last modification on : Thursday, February 11, 2021 - 2:48:12 PM
Long-term archiving on: : Tuesday, April 12, 2011 - 10:33:47 PM

Identifiers

  • HAL Id : inria-00075326, version 1

Collections

Citation

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

Share

Metrics

Record views

154

Files downloads

93