Résolution de problèmes d’ordonnancement par les treillis de Galois et les graphes d’intervalle. (French) Zbl 0549.90054

Summary: This paper deals with the scheduling problem in which lots have variable set up times that are dependent upon the precedent lots. With the Galois lattice, the proposed method gives the groups of lots that can be used to construct an interactive scheduling. In the case of flow shop, the interval graph gives partial order on the lots, that minimizes the total set-up times and allows to optimize the scheduling with any criteria.


90B35 Deterministic scheduling theory in operations research