Scheduling to minimize over-regular criteria

Abstract : In this paper,we define a new class of scheduling criteria called over-regular criteria. This class is a subclass of regular criteria. We analyze the properties of scheduling problems with over-regular criteria. In the literature a lot of effort has been made to solve specific problems, these properties, however, are applicable to several scheduling problems. Using these properties and proving additional specific ones, we propose a procedure to solve the scheduling problem to minimize total tardiness with generalized due dates. This latter problem particularly arises in maintenance departments where maintained parts are interchangeable. Computational results are also reported.
Type de document :
Rapport
[Research Report] RR-1704, INRIA. 1992, pp.16
Liste complète des métadonnées

https://hal.inria.fr/inria-00076941
Contributeur : Rapport de Recherche Inria <>
Soumis le : lundi 29 mai 2006 - 11:39:10
Dernière modification le : samedi 17 septembre 2016 - 01:06:48
Document(s) archivé(s) le : vendredi 13 mai 2011 - 22:08:35

Fichiers

Identifiants

  • HAL Id : inria-00076941, version 1

Collections

Citation

Chengbin Chu. Scheduling to minimize over-regular criteria. [Research Report] RR-1704, INRIA. 1992, pp.16. 〈inria-00076941〉

Partager

Métriques

Consultations de la notice

117

Téléchargements de fichiers

43