Scheduling to minimize over-regular criteria - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 1992

Scheduling to minimize over-regular criteria


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.
Fichier principal
Vignette du fichier
RR-1704.pdf (732.43 Ko) Télécharger le fichier

Dates and versions

inria-00076941 , version 1 (29-05-2006)


  • HAL Id : inria-00076941 , version 1


Chengbin Chu. Scheduling to minimize over-regular criteria. [Research Report] RR-1704, INRIA. 1992, pp.16. ⟨inria-00076941⟩
47 View
19 Download


Gmail Facebook Twitter LinkedIn More